Construct state diagrams of DFAs for each of the languages below. Each language is over the alphabet {0, 1}.

a. {w | w contains an even number of 0s and an odd number of 1s and does not contain the substring 10}