1. (40 points) Please give the state diagram of a DFA for the language given. In all parts, = {a,b} (1) {ww has an odd number of a 's and ends with a b} (2) {ww contains neither the substrings ab nor ba } (3) {ww has even length and an odd number of a's } (4) {ww has an even number of a's and each a is followed by at least one b} Note, Your solution should be a DFA solution