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}.

simple diagram

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

{w| w does not contain the substring 1101}