Please do the following question . Show all work , and write clearly, so it could be understood

13. Consider again the finite-state automaton of exercise 3. a. To what state does the automaton go when the symbols of the following strings are input to it in sequence, start- ing from the initial state? (i) bb (ii) aa (iii) babbbbbabaa (iv) bbaaaabaa b. Which of the strings in part (a) send the automaton to an accepting state? c. What is the language accepted by the automaton? d. Find a regular expression that defines the language 13. Consider again the finite-state automaton of exercise 3. a. To what state does the automaton go when the symbols of the following strings are input to it in sequence, start- ing from the initial state? (i) bb (ii) aa (iii) babbbbbabaa (iv) bbaaaabaa b. Which of the strings in part (a) send the automaton to an accepting state? c. What is the language accepted by the automaton? d. Find a regular expression that defines the language