2. Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to produce a final state diagram for the original language. Assume the alphabet ? = {a,b). b. {wlw is any string not in a*b*}