(30 points). Draw a DFAs recognizing each of the following languages, over the alphabet = { 0 , 1 } .

(a) { w | w contains at least three 1s }

(b) { w | w contains at exactly two 0s }

(c) { w | w contains the substring 011 }