Let $G$ be a context$-$free grammar in Greibach Normal Form.

G

$S$aSB$|aA$

$Bb$

$AaA|a$

Let M$1,$ M$2,$ M$3$ and M$4$ be the following nondeterministic pushdown automata $($npdas$)$ For

each of these npdas, decide whether or not the machine accepts L$($G$).$

M$1$

M$1$ accepts $L(G).$

M$2$

M$2$ accepts $L(G).$

M$3$

M$3$ accepts $L(G).$

M$4$

M$4$ accepts L$($G$).$