onsider the PDA M$1$ below.

Express L$($M$1)$ in set notation. Justify your answer.

$($b$)$ Is there a finite state automaton $($either nondeterministic or deterministic$)$ for L$($M$1)?$ Justify

your answer.

Note: there is no need to give either a specific automaton or a proof that no such automaton

exists; an informal argument will suffice.

$($c$)$ Consider the language L$2=\{4$i$3$j $2$k$12$i $|$ j$=$ k$,$ i$,$ j$,$ k $0,\}$ Is there a PDA for L$2?$ Justify

your answer