For the PDAs shown in Fig. 1 and Fig. 2, which one/ones or no one would accept the language L=xa, b* Nax=1+Nb(x)} by empty stack? Use the execution of the stringabaabto justify your answer. For the PDAs shown in Fig. 1 and Fig. 2, which one/ones or no one would accept the language L=xa, b* Nax=1+Nb(x)} by empty stack? Use the execution of the stringabaabto justify your answer.

The answer I get is that none of the figures will accept this language, as in both figures you end up with a "a" and "x" left in the stack, with no further doable instructions, thus resulting in a non-empty stack. Please confirm whether I am right or wrong, thanks!

A a) M py pop Start 4. PUNOS AX po AY AX non pas Fig. 1 UN FMsh(a) pura(a) pop po wy b. 61 pusho) who) Fig 2 Sol For the PDA in Figure 1, we have For the PDA in Figure 2, we have 10, abaeb. XI 10, abeab, x)