Exercise 2 (20 points). Convert the following NFA to a DFA, using the method discussed in class and in section 1.2 of the textbook (3rd edition: p. 55). Show the steps. Exercise 3 (15 points). Give a regular expression for each of the following languages, over the alphabet {0,1,2): (a) Strings ending with 0. (b) Strings with an odd number of 2's, then a 1, then an even number of O's (and no other characters). (c) Strings where all the O's come before all the l's, or all the l's come before all the 2's