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

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

g. { w│w has even length and an odd number of a’s}