Consider the fiNite-State Automaton Given by the Following Transition Diagram $N \left( s _ { 2 } , a \right)$

Essay

Consider the finite-state automaton given by the following transition diagram:
(a) What is $N \left( s _ { 2 } , a \right)$ ?
(b) To what state does the automaton go if the string babaa is input to it?
(c) Indicate which of the following strings are accepted by the automaton: $$a b a b \quad b b a b \quad a b b b a a \quad a$$
(d) Describe the language accepted by this automaton.
(e) Find a regular expression that defines the same language.