## Discussion Forum

Que. | Given two languages: L1= {(ab)n,ak I n> k, k >=0} L2 = {an bm l n ≠ m} 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:L1 is regular and L2 is not regular |