Chapter 12 6. Consider the finite-state automaton given by the following transition diagram: ( 5 points 2.5 each) a SO b की $2 b a $1 a 1. What is N(s2, a)? 2. To what state does the automaton go if the string babaa is input to it? 3. Indicate which of the following strings are accepted by the automaton: abab bbab abbbaa a 4. Describe the language accepted by this automaton 5. Find a regular expression that defines the same language 7. Consider the regular expression a (a | b) * b ( 5 points 2.5 each) a. Describe the language defined by this expression. b. Design a finite-state automaton to accept the language defined by the expression.