1. Consider the language L = {W S* | W = 0(w)}, where I = {a, c,g,t} and e: * * is defined o if w = , then e(w) = , o if w= b for bes, then (a) = t 0(t) = a (c) = 9 0(g) = C, o if w = xb for 2 * and be, then 0(xb) = 6(b)(). Give a PDA that accepts L. Informally explain how the PDA is correct