For the pushdown automata shown in Fig. 3 and Fig. 4, which one/ones or no one would accept the language { b²ⁿaⁿ | n >= 0} by final state? Use the execution of the string b⁴a² to justify your answer.

Test the string bbbbaa through each PDA shown above and show work, please and thank you!

and V (quand u, NOR Start x 0 AX 1.X nop or cop Fig. 3 H | Start X pop b.a pop AX pop RIGP palla) puha)