Give the state diagram of DFAs recognizing the following languages. In all cases, the alphabet is { 0, 1 }.

{ w | w starts with 0 and has odd length, or starts with 1 and has even length }