Push down Automata

1. . Let M be the PDA below: aa/A b/B a A/ bB/A Raw / 90 a) b) c) Give the transition table of M. Trace all computations of strings ab, bb, baab in M. Give a set-theoretic definition of L(M)