For each of the following languages, construct a DFA that accepts the language. In all cases, the
alphabet is {0, 1}.
a. { W| W contains at least five 1s}
b. { W| W contains an odd number of 1s or exactly two 0s}
c. { W| W every odd position in W is 1}