Problem 1. For the following problems, do not "simplify" your work (except you should please not indicate unreachable states in any DFA) show everything. (a) Using the procedure shown in class, convert the following NFA into a DFA for the same language. 0,1 2 (b) Using the procedure shown in class, convert the same NFA into a regular expression for the same language. (c) Using the procedure shown in class, convert the following regular expression into an NFA for the same language: (OU0I)* U 10