Problem 4 (20 points). 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 of product automaton discussed in class 1. {w/w has at least three a's and at least two bs} 2. {w]w has an odd number of a's and ends with a b}