Question 2. Given the following finite automaton M, produce a regular expression R with L(R)-L(M) using the algorithm used in the proof of the theorem that says that the class of regular languages is equivalent to the class of languages described by regular expressions. Show your work. 1, 0 0 go 0