1. Draw a finite automaton that accepts the language over the alphabet {a,b} in which all

strings have an even length and an odd number of as.

2. Construct a DFA that recognizes the following language over the alphabet {a,b}.

L = {w | w has an even number of as, no two of which are consecutive}