Give the state diagrams of DFAs recognizing the following languages over = {0, 1}:

a) L

b) L

c) {, 1, 101}

d) {w : w contains exactly three 1s}