Automata Theory Computer Science

2. Give the state diagrams of DFAs recognizing the following languages over 2 = {0, 1}: a. {w: w does not contain substring 10} b. {w: every odd position of w is a 1} c. {w: w does not begin and end with same symbol}