2. 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 a and has at most one b} b. {w:w has an odd number of b's or ends in c }