Need to do $1b$ and $1$C$.$For $1$C ONLY ONE computation for every string $-$ the successful computation, if there is one, or the computation that goes furthest when processing the string

Let $M$ be the PDA defined by

$Q=\{q_0,q_1,q_2\},(q_0,a,)=\{[q_0,A]\}$

$=\{a,b\},(q_0,,)=\{[q_1,]\}$

$=\{A\},(q_0,b,A)=\{[q_2,]\}$

$F=\{q_1,q_2\},(q_1,,A)=\{[q_1,]\}$

$,(q_2,b,A)=\{[q_2,]\}$

$,(q_2,,A)=\{[q_2,]\}.$

b$)$ Give the state diagram of $M.$

c$)$ Trace all computations of the strings aab,abb,aba in $M.$