14. Recall the DFA D we constructed that accepts a binary string iff it has an odd number of 1's: (a) Convert D into an equivalent clean e-NFA using the clean-up procedure in class (add a new start state, a new final state, and some e-transitions) (b) Use the state elimination method to convert D to a regular expression. Eliminate state A first, then B 15. Same exercise as before, except make A the final state (so that D accepts a string iff it has an even number of 1's)