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

a. {w : w has prefix 110}

b. {w : w has suffix 001}

c. {w : w contains the substring 101}