Using the proof above, draw the state diagram for the DFAs that accept the following languages [in all of the problems, 2 = {a, b}]: 9. ir {w w has exactly two a's and at least two b's} {wl w has an even number of a's and each a is followed by at least one b} Hint: Each of these languages are the combination of two simpler regular languages