. Recall that the following PDA M accepting language L = {w {0, 1} : w = w r}: M = hQ, , , , q0, Z0, Ai where Q = {q0, qeven, qodd, q2}, = {0, 1}, = {0, 1, Z0}, A = {q2}. Moves are: (q0, 1, 2) = {(q0, 12)} with 1 = 0, 1, 2 = 0, 1, (q0,, 1) = {(qeven, 1),(qodd, 1)} (q0,, 0) = {(qeven, 0),(qodd, 0)} (qodd, 1, 2) = {(qeven, 2)} with 1 = 0, 1, 2 = 0, 1 (qeven, 1, 1) = {(qeven,)} (qeven, 0, 0) = {(qeven,)} (qeven,, Z0) = {(q2,)} (empty-stack acceptance) (q0,, Z0) = {(q2,)} (make sure that is accepted) Translate M into a grammar G.