Can you please draw a PDA that describes this: Give a pushdown automaton that recognizes the language L={(ab)^na^n |nN}.

The pushdown automaton has states q0, q1, q2 and the following transitions.

accept the empty word

(q0,,#) (q0,)

read (read)^n and count n on the stack

(q0,a,#) (q1,)

(q1,b,) (q0,)

(q0,a,)(q1,)

(q1,b,) (q0,)

and eventually go to q2

(q1,b,) (q2,)

read on

(q2,a,) (q2,)