4. Each of the following languages are composed of two simpler languages over the alphabet = {a,b,c}. For both, construct the DFA's for the simpler languages, then combine them using the construction of the closure proof presented in lecture and page 46 of text): a. W: w starts with c and has at most one b) b. {w: w has an even number of c's or ends in b}