please make sure it is a correct NFA, and show the diagram with initial state, final state, transitions, states, etc. as an example, the strings 01010101 and 10111001 would both be accepted

(4 points) Give an NFA accepting the set of strings {0,1} such that two 0 s are separated by a string whose length is 3i, for some i0