Prove that grammar $G=(\{S,A,B\},\{a,b\},S,P)$ where $P$ includes $S$aAB,$AbBb,$ and $BA|||$ is ambiguous.

Determine the language accepted by this NPDA

$M=(Q,,,,q_0,z,F)$ where $Q=\{\begin{array}{c}{q}_0\\ q\end{array}$ q $\{$:$q_2,q_3,q_f\},=\{a,b,c\},=\{0,1\},z=0,F=\{q_f\}$ and $$ includes

$(q_0,a,0)=\{(q_1,10),(q_2,0)\}$

$(q_0,b,0)=\{(q_2,10)\}$

$(q_1,a,1)=\{(q_1,11)\}$

$(q_1,b,1)=\{(q_2,11)\}$

$(q_2,b,1)=\{(q_2,11)\}$

$(q_2,b,0)=\{(q_3,10)\}$

$(q_2,c,1)=\{(q_3,)\}$

$(q_3,c,1)=\{(q_3,)\}$

$(q_3,,0)=\{(q_f,0)\}$