Can Someone Help me with these problems

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}.

a. {w| w has at least three as and at least two bs}

c. {w| w has an even number of as and one or two bs}

e. {w| w starts with an a and has at most one b}