I am hoping that you are asking about " a binary number divisible by 2" .
So, string accepted is :
and so on...
So for dfa and nfa ( for both ) it require only 2 states.
suppose q0 and q1 are the two states in minimal dfa and q0 is the final state.
q0 ->0 = q0
q0 ->1 = q1
q1->0 = q0
q1 ->1 = q1
I hope so you will get this, otherwise post your nfa and dfa in the comment section.
There must be mistakes by you when you have solve this question.