For the language L described below, draw the transition diagram of a deterministic finite automaton that accepts L. Make sure that the initial state is clearly labeled, and that each accepting state is drawn with two concentric circles. Be sure to draw a complete automaton, so that every state has an arrow out for each symbol in the alphabet. In addition, provide a brief explanation of your construction in English, detailing what states represent and how strings are accepted. Your explanation should give the ideas and intuition behind the construction, not a detailed listing of the transitions (which would only be a repetition of what is represented in the diagram). L is the set of strings over {a, b in which there is an a in every even position (where the first symbol is in an odd position) and the total number of b's is odd. Example string in L: baaaaabab