solve all parts

subject graph theory

Bonus Question (extra 3 points out of 100 in the final grade). Consider the DFA Mg defined over the alphabet E = {0, 1, 2} and depicted in figure 3. 91 1 2 0 4 . 90 | 1 2 1 2 92 Figure 3: DFA MB a) Convert Mg into a GNFA. b) Use the procedure described in class to obtain a regular expression that describes the language recognized by MB. Remember to justify your solution by showing the different steps of the procedure as each state of the GNFA is removed