Give nondeterministic finite automata accepting the set of strings of 0s and 1s such that there are two 0s separated by a number of positions that is a multiple of 3. (Note: 0 is NOT an allowable multiple of 3, so 00 is not in language while 111010101111 is)). Try to take advantage of nondeterminism as much as possible.