<p>Consider the following pushdown automata (PDA) where s is thestarting state and f is the favorablestate:</p><p>(s,a,a)->(s,aa)</p><p>(s,a,lambda)->(s,a)</p><p>(s,b,a)->(f,lambda)<br/><br/>(f,b,a)->(f,lambda)</p><p>(f,a,a)->(f,lambda)</p><p>(a) Give the computation of the PDA (give the state, inputstring still to be read,