$0.$ Design PDAs that recognises the following languages. For each automata, briefly explain in $3$ sentences or less how your automata works: $($a$)\{$a n b ma n $|$ m$,$ n in N$\}($b$)\{$a n b m $|$ n $$ m $2$n $$ m$,$ n in N$\}$