2 (a) (5 points) Draw a state diagram of a DFA that recognizes the language w w ends in 01. This can be done in 3 states, which you will probably want to use because using more will make part b harder. (b) (15 points) Convert the DFA you drew in (a) into a GNFA (add s and t), and then remove states until you are left with just a regular expression from s to t. 3 (30 points) Use the pumping lemma to show that the following languages are not regular (b) A2 www we )