1. Use the above procedure to find a regular expression that describes the language of M2 from the previous homework, depicted below. 1 1 1 qi 42 93 0 0 (a) Construct a GNFA (call it No) for this machine following rules (a)-(e) above. That is, add a new initial state, a new accept state, and connect all intermediate states to one another with transitions labeled with regular expressions. Your GNFA should have5 states, and each state (other than the accept state) should have 4 outgoing transitions (any transition labeled with the 0 means it's a transition that didn't exist in the original machine). (b) What is the GNFA that results from ripping state gi out of No? Call this machine N (c) What is the GNFA that results from ripping state g2 out of N? Call this machine N2 (d) What is the GNFA that results from ripping state qs out of N2? Call this machine N (e) Using N3, determine a regular expression that describes the language of the original DFA. 1. Use the above procedure to find a regular expression that describes the language of M2 from the previous homework, depicted below. 1 1 1 qi 42 93 0 0 (a) Construct a GNFA (call it No) for this machine following rules (a)-(e) above. That is, add a new initial state, a new accept state, and connect all intermediate states to one another with transitions labeled with regular expressions. Your GNFA should have5 states, and each state (other than the accept state) should have 4 outgoing transitions (any transition labeled with the 0 means it's a transition that didn't exist in the original machine). (b) What is the GNFA that results from ripping state gi out of No? Call this machine N (c) What is the GNFA that results from ripping state g2 out of N? Call this machine N2 (d) What is the GNFA that results from ripping state qs out of N2? Call this machine N (e) Using N3, determine a regular expression that describes the language of the original DFA