6. [10 Points) Use the method from class (lecture 8d) to convert the following automaton to a regular expression. First construct the corresponding GNFA (without labeled edges), then strip states one by one in decreasing numerical order (strip state 3 first, then state 2, then state 1). Show your work, including the diagrams after each stripping. a. b a 3 a. b b