Q23,p3,d14. Given two languages :

L1= {(ab)nak| n > k, k ≥0}

L2= {anbm| n ≠m}

Using pumping lemma for regular language, it can be shown that

(A) L1 is regular and L2 is not regular.

(B) L1is not regular and L 2 is regular.

(C) L1is regular and L2 is regular.

(D) L1is not regular and L2 is not regular

Answer D.