Give the regular expression that describes the language recognized by each of the following automata. For all parts, the alphabet is {a, b}. If you dont use the construction from Kleenes theorem, for at least one problem build the starting GNFA from the construction and show the GNFA after deleting one state (i.e. the start and first iteration of the construction).

8. Give the regular expression that describes the language recognized by each of the following automata. For all parts, the alphabet is ta, b). If you don't use the construction from Kleene's theorem, for at least one problem build the starting GNFA from the construction and show the GNFA after deleting one state (i.e. the start and first iteration of the construction). (a) b a, a, b start qu (b) start 94