Give state diagrams of DFAs that recognize 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 strings x, y}