Construct a DFA that recognizes the following language of strings over the alphabet $\{$a$,$b$\}$:

$\{$w$|$ w is any word which is not a repetition of strings of the form $($ab$)($b$...$b$)\}.$ Note that "repetition" and $"..."$ may indicate zero such things.