Consider the following language S = {0,1}:

D = {w : w contains an even number of 0s,

w contains an odd number of 1s,

and w and does not contain the substring 01}

Give a DFA recognizing D with exactly 5 states.

Hint: Start by constructing a machine for the first two conditions.