2) For each of the following construct a DFA for the indicated language. Please turn in the state diagram for it. Assume = {0,1}. (5 points each). a) {wlw does not contain the substring 001} b) {wlw begins with a 0 and ends with a 1} c) {wlw is exactly of length 4} d) {w levery even position of w is 0} e) {0101, 111, 00, 0}