Please draw the DFA Each of the following languages are composed of two simpler languages over the alphabet = {a, b, c}. For both, construct the DFAs for the simpler languages, then combine them using the construction of the closure proof presented in lecture {w : w has an odd number of bs or ends in c}