A$.$ Consider the following two languages and develop the pushdown automaton PDA that

accept these languages.

a$.L=\{a^i{b}^j{c}^j{d}^i.i,j1\}.$ Show that your PDA accepts abcd and rejects aabbedd.

b$.L=\{\begin{array}{c}{0}^m{1}^n|m\end{array}$ not$-$equal $n$ and $\{$:$m,n0\}$