Please solve number 11 and all of its parts. If possible draw the DFA on paper so its easier to understand for me.

1. Consider the set of strings on {0,1} defined by the requirements belo 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 stringe in which the leftmont two pymbols and the rightmont two symbols are identical. (g) All strings of Jength four or greater in which the Infmant tivo nymbols are the name, but different from the rightmont symbal