(20 points) Perform the following: (a) (5 points) Draw a state diagram of a DFA that recognizes the language {w | w ends with 01) Note that your machine should have exactly 3 states and make sure that your start state is the state go and your accept state is the state q2. (b) (5 points) From your state diagram in (a), convert it into a GNFA as discussed in class. Note that you do not need to remove any states yet (c) (10 points) From your GNFA in (b), convert it into a regular expressing using the scussed in class. Note that vou must remove states in that order