1. 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} 2. Give the state diagrams of DFAs recognizing the following languages over ={0,1} : a. {w:w does not contain substring 10} b. {w: every odd position of w is a 1} c. {w:w contains at least one 0 and at least one 1}