Need help with Q17(a,b) ?

e) Give the derivatior ebe the PDA in Example 7.1.1. ace the computation of aabbbb in G. of aabbbb in xt-free grammar Gtha is. Let M be the PDA Tace the computation in M that accepts bbcbb eorem 7.3.2 to construct a grammar G that accepts LM) Give the derivation of bbebb in G resented a technique for constructing a grammar that 16 Theorem 7.3.2 cepted by an extended PDA. The transitions of th generates the that generates the anguage acdo the stack. Generalize this construction to build grammars from arbitrary ions of the PDA puhe variables A. Prove that the resulting grammar generates the language of the PDA g lemma to prove that each of the following languages is not context 1 free. Ma* | k is a perfect square) d)(aible 10