Consider the set of strings on {0, 1} defined by the requirements below. For each, construct an accepting dfa.

(d) Every substring of four symbols has, at most, two 0s. For example, 001110 and 011001 are in the language, but 10010 is not because one of its substrings, 0010, contains three zeros.

10 test cases for automaton including strings that should be accepted.

10 test cases for automaton that should not be accepted.