2. Give the transition diagram for a DFA for each of the following languages over the alphabet {0,1}: (a) {w : w does not contain the substring 001} (b) {w: every pair of consecutive O's in w occurs before any pair of consecutive l's } (c) {w : (no(w) + n1(w)) mod 3 =2}