Consider the Pushdown Automaton $($PDA$)$ for the language$$L$=\{$an$+1$b$2$n$|$ n$>0\}.$

The following relate to the PDA:$$

$=\{$a$,$b$\}$

$=\{$a$,$Z$\}$

Q $=\{$q$0,$ q$1,$ q$2,$ and q$3\},$ where q$0$ is the initial state and q$3$ is the final state.

Negative grading applies.

Do NOT include any spaces between characters, symbols, or punctuation marks. Write everything as one string, excluding spaces.

If you want to include something like q$0,$ type it out as q$0.$ Do not paste anything except for special symbols such as $,$ $,$ etc.$$

Take Z as the bottom$-$of$-$stack indicator and assume that it is already in the stack

$1.)$ Complete the transition function for the PDA