Discuss the below:
Q: Consider the language B = L (G), where G is the grammar given. The pumping lemma for context-free languages, Theorem states the existence of a pumping length p for B. What is the minimum value of p that works in the pumping lemma? Justify your answer.
Attachment:- Pumping lemma theorem.rar