Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs for the simpler languages, then combine to give the state diagram of a DFA for the language given. In all parts, E = {0,1}. a) {w|w has an even number of 0's and one or two l's} b) {w[w starts with a 0 and has at most one 1} c) {w\w has an odd number of Os, and ends with a 1}