Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}.

{w | accept all string except 11 or 110}

{w | w begins with a 11 and ends with a 0}

{w : w start with 00 and has odd length }

{w| w does not contain the substring 1101}

{ w | w contains at least three 0s }