Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then?

Let the class of language accepted by finite state machine be L1 and

1.	Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then?
A.	L1<l2
B.	L1>=L2
C.	L1 U L2 = .*
D.	L1=L2
Answer» E.