Reference: Introduction to Theory of Computation by Michael Sipser, Third edition Problem 1. Convert the DFA (over 2-a, b]) presented on the figure below to a corresponding regular expression (see Lemma 1.60 in the class-book). 41 12 a,b 93 Note that the resulting regular expression might be quite long