2. For the following automaton: a b a. Give a regular expression describing the language accepted by this automaton. This regular expression should be as simple as possible. b. Give a precise, concise and unambiguous English description of the language accepted by this automaton. c. Draw the simplest possible DFA (i.e. with fewest number of states) equivalent to this automaton.