Using pumping lemma for regular language, it can be shown that
A. L1 is regular and L2 is not regular.
B. L1 is not regular and L2 is regular.
C. L1 is regular and L2 is regular.
D. L1 is not regular and L2 is not regular.
Answer:D
Using pumping lemma for regular language, it can be shown that
A. L1 is regular and L2 is not regular. B. L1 is not regular and L2 is regular. C. L1 is regular and L2 is regular. D. L1 is not regular and L2 is not regular.