$(34)$ Let $M$ be the DF $$ with input alphabet $\{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.