Use the construction given in the lecture to give a two state PDA that accepts the (1pt)
language generated by this grammar.
b) Let $M$ be the PDA over the alphabet $\{a, b, c\}$ and with stack alphabet $\{A, B\}$ given by the following
graph.
a,A/λ
$q_0$
b,λ/B
c,B/A
Use the procedure given in the lecture to construct a grammar that generates $L(M)$, (2.5pt)
and give a derivation of the word bcbcaa.