Give nondeterministic finite automata accepting the set of strings of 0s and 1s such that there are two 1s separated by a number of positions that is a multiple of 2. (Note: 0 is an allowable multiple of 2). Try to take advantage of nondeterminism as much as possible and explain your work.