Give the state diagrams of DFAs recognising the following languages over = {0, 1}: a. {w : w does not contain substring 10} b. {w : every odd position of w is a 1} c. {w : w contains at least one 0 and at least one 1}