Consider the following pushdown automata (pda) where s is the starting state and f is the favorable state:

(s, a, aa) ? (s, a); (s, a, ? ) ? (s, a); (s, b, a) ? (f, ? ); (f, b, a) ? (f, ? ); (f, a, a) ? (f, ? )

give the computation of the pda (give the state, input string still to be read, and top of the stack symbol (a, b, ? ) on the string aaabba, abbaaa, and baba. determine which of the strings are accepted by the pda.
determine the language accepted by the pda.