1.4 Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs for the simpler languages, then combine them using the construction discussed in footnote 3 (page 46) to give the state diagram of a DFA for the language given. In all parts, ={a,b}. c. {ww has an even number of a's and one or two b's } e. {ww starts with an a and has at most one b} f. {ww has an odd number of a's and ends with a b } g. {ww has even length and an odd number of a's }