Question 5: [3,5 points) a) Use the pumping lemma to show that the language L { a"b"allosisn, 15 m}.is not regular. b) Find a context-free grammar G generating the above language L. c) Draw a pushdown automaton with at most two states recognizing the language L and using only one single stack symbol (which therefore must be the initial stack symbol Zo). d) Draw a pushdown automaton with one single state and accepting by empty stack recognizing the language L. There are no restrictions on the number of stack symbols needed. Question 5: [3,5 points) a) Use the pumping lemma to show that the language L { a"b"allosisn, 15 m}.is not regular. b) Find a context-free grammar G generating the above language L. c) Draw a pushdown automaton with at most two states recognizing the language L and using only one single stack symbol (which therefore must be the initial stack symbol Zo). d) Draw a pushdown automaton with one single state and accepting by empty stack recognizing the language L. There are no restrictions on the number of stack symbols needed