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

j. {w | w contains at least two Os and at most one 1}

k. {E, 0}

m. The empty set

n. All strings except the empty string