5. For the given deterministic pushdown automata shown in Fig. 3 and Fig. 4, which one would accept the language {anb2n n >= 0} by final state? Use the execution of the string a2b4 to justify your answer. (10 points) 2 _ or nop pop nop StartX pop a, a pusha) pusa) Fig. 3 nop pop b. a Start X 3 nop nop pop hop a, a push(a) push(a) Fig. 4