## Discussion Forum

Que. | A language L satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about L is TRUE? |

a. | L is necessarily a regular language |

b. | L is necessarily a context-free language, but not necessarily a regular language |

c. | L is necessarily a non-regular language |

d. | None of the above |

Answer:None of the above |