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

a. {w | w begins with a 1 and ends with a 0}

b. {w | w contains at least three 1s}

C. {w | w contains the substring 0101, i.e., W = x0101y for some x and y}

i. (w | every odd position of w is a 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