Follow the directions for 14 and construct a DFA

1. Consider the set of strings on {0,1} defined by the requirements below. each, construct an accepting dfa. (a) Every 00 is followed immediately by a 1. For example, the strings 101,0010,0010011001 are in the language, but 0001 and 00100 are not. (b) All strings that contain the substring 000 , but not 0000 . (c) The leftmost symbol differs from the rightmost one. (d) Every substring of four symbols has, at most, two 0's. For ex. ample, 001110 and 011001 are in the language, but 10010 is not because one of its substrings, 0010, contains three zeros. (e) All strings of length five or more in which the third symbol from the right end is different from the leftmost symbol. Chapter 2 Finite Automata (f) All utrings in which the leftmant two symbole and the rightmost two nymbole are identical. () All strings of bensth four of greator in wheh the Ifftinges two nymbola are the mame. but different from the rightukot aymbol