Please solve number 11 and its parts

1. Consider the set of strings on {0,1} defined by the requirements below. For 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 example, 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 strings in which the leftmost two symbols and the rightmoet two symbols are identical. (g) All strings of length four or greater in which the leftmost two symbols are the aame, but different from the rightmont symbol