Answer Happy

Desperately need help with this
b. Consider the language We want to construct a Pushdown Automaton Move State Input No. that accepts L. We proceed as follows. In state go the PDA initially reads input symbols and pushes an z onto the stack for each one read. At some point, it guesses that the next symbol read will be the one that fails to match the corresponding symbol in the second half. It pushes that symbol onto the stack and enters the state 9₁. In state q₁, the PDA reads input, leaving the stack alone, until it guesses that it has reached the input symbol that corresponds to (i.e., fails to match) the top stack symbol. At this point it enters 92, having read that input symbol and popped the nonmatching stack symbol. From that point on, the PDA is concerned only with the length of the remaining input. It pops an from the stack for each input symbol read until the stack is empty except for Zo, and at this point it enters the accepting state. Complete the following transition table. 1 2 3 4 5 6 7 8 9 10 11 90 90 90 90 91 91 91 91 92 92 92 a b a b a b b a a L = {x{a,b}* | 2 is not a palindrome} b > M = ({90, 91, 92, 93}, {a,b}, I, 90, Zo, {93}, 6) Stack symbol Zo Zo I I a b a b I Zo Move(s) 17 marks