Give an NFA accepting the set of strings $\{0,1\}$ such that two $1$s are sepa$-$

rated by a string whose length is $4$i$,$ for some i $>=0.$ Show the transition graph for this as well.