Determine the language L over the alphabet A = {a, b} accepted by the finite state
automaton pictured below. Give a precise description of L. Note that the start state
on the left is also an accept state.