Let $M$ be the DFA with input alphabot $\{0,1,2\}$ and transition function:

Using the GNFA method from class, produce a regular expression that describes the

language recognized by $M.$ Show each GNFA produced in the process $($ex$.$ so the initial GNFA then show the GNFA after removing q$2).$