DFA Closure: 1.4 c and f. Do union and intersection for each (use cross product algorithm) Each of the following languages is the intersection of two simpler languages. In each part, construct DFAs fo

DFA Closure: 1.4 c and f. Do union and intersection for each (use cross product algorithm)

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) {w| w has an even number of a’s and one or two b’s}

f) {w| w has an odd number of a’s and ends with a b}