Construct a nondeterministic pushdown automaton $($NPDA$)$ that accepts the language $L=\{a^n{b}^n,n0\}.$

Describe the states and transitions of the automaton.

States $($Q$)$:

Input Alphabet $()$:

Stack Alphabet $()$:

Start State:

Start Stack Symbol:

Accept State$($s$)($F$)$:

Transition Functions $()$: $q_0,q_1,$ etc.$>$