For each language over {a,b}, give the state diagram and formal definition of the DFA that recognizes it:

a) The language of all words with exactly 4 letters.

b) The language of all words that begin or end with a double letter.

c) The language of all words with only a's or only b's. For clarification, the empty string is not in this language.