1. a)Consider = {a}. Show the diagram for a DFA that accepts all strings over with odd number of as. Clearly show the start state and final states b)For the same alphabet set as above, show the diagram for a DFA that accepts all strings with number of as not divisible by 3, i.e. , 2, 4, 5, 6, 8, 10+ etc. Clearly show the start state and final states c)Using answers for a and b, construct the DFA for accepting all strings over the same alphabet that accepts all strings with number of as which is odd but not divisible by 3, i.e. a, 5, 7, 11, 13, etc. Clearly show the start state and final states.