## Discussion Forum

Que. | Pumping -lemma for context-free languages states : Let Lbe an infinite context free language. Then there exists some positive integer m such that any w ∈ L with Iwl ≥m can be decomposed as w = uv xy Z with Ivxyl_________ and Ivy I such that uvz, xyZ Z ∈ L for all z = 0, 1,2, ....... |

a. | ≤m, ≤1 |

b. | ≤m,≥1 |

c. | ≥m,≤1 |

d. | ≥m, ≥1 |

Answer:≤m,≥1 |