IL CUC CU P bbb exactly once 2. Let S = {a,b) for this problem.. a. Give a finite automaton M, that accepts all even length strings. b. Give a finite automaton M, that accepts all strings with an odd number of a's. c. For the finite automata M1 given in Part a and My given in Part b contruct an automaton that recognizes the language L(Min L(M2)