The questions say "$\dots$there is a pair of 0's separated $\dots$". Assuming that one such pair in a string would suffice, the minimum number of states in NFA will be 6.
Let's start with the regular expression for this language since that will help us in NFA designing. Again existence of one such pair would suffice, therefore the rest of the string could be selected arbitrarily.
$$(0+1)^*0((0+1)^4)^*0(0+1)^*$$
Thus, an equivalent NFA would look something like this -
