Question $(4)-$ Design non$-$deterministic Pushdown Automata to accept the following languages over the alphabet $\{$a$,$ b$,$ c$\}$

$1.$ Language L$=\{$a power m$,$b power n such that m $>=0$and n $=2$ m $\}($accept by empty stack with the stack initially empty$).$

$2.$ Language L $=\{$ a power m$,$b power n such that m $>=0$and $$n$<$ m $\}($accept by final state$)$