Design nondeterministic PDAs for accepting the following languages. In both cases,

$[25$ marks$]$

only the symbols $\{0,1,$$$\}$ are permitted to be used on the stack. In each case, explain

your approach in addition to supplying the PDA.

$($a$)L1=\{w{w}^{\text{'}}|w=\{0,1\}**\}$ where $w^{\text{'}}$ is the reverse of $w.$

$($b$)L2=\{0^n{1}^m{2}^m{3}^n|n1,m1\}.$