For each of the languages below, come up with a finite automaton that recognizes the language. Draw a state diagram and give the formal definition. The formal definition consists of the set of states Q, the alphabet E, the transition function d, the start state which must be an element of Q, and the set of accept states F. For all languages the alphabet is {a, b} 1. 2. {wwhas at exactly two a's and at least two b's} 3. {w whas an even number of a's and one or two b's} 4. {w/ whas even length and an odd number of a's}