Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs for the simpler language, 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, = {0, 1}. i. {w | w has even length and an odd number of 0s} ii. {w| w has an even number of 0s and one or two 1s}