Design nondererministic PDAs for accepting the following languages. In both cases, marks$]$

you may only use the symbols $x$ and $ on the stack.

$($a$)L1=\{a^v{b}^u|n_{1}1\}$

$($b$)L2=\{a^n{c}^n{b}^n|n1,mn1\}$Design nondeterministic PDAs for accepting the following languages. In both cases, you may only use the symbols x and $ on the stack.

$($a$)$ L$1=\{$a

n

b

n

$|$n $>=1\}$

$($b$)$ L$2=\{$a

n

c

mb

n

$|$n $>=1,$ m $>=1\}$