Can Someone Help Me With These Problems Thanks

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

G {w| the length of w is at most 5}

h. {w| w is any string except 11 and 111} i. {w| every odd position of w is a 1} j. {w|w contains at least two 0s and at most one 1} k. {, 0} l. {w|w contains an even number of 0s, or contains exactly two 1s} m. The empty set n. All strings except the empty string