Problem in Understanding the DFA, Need Help

Question

I am reading Hopcroft Ullman - Automata Theory(2nd Edition).

In page Number 65 (Red Underline part in the given Image); I understand when i=1  but unable to understand when i>1 then how the Accepting and Non-accepting State are same.

My Point is "if i > 1 then a1 or b1 may be 1. So, then How it must be both Accepting and Non-Accepting; it may be Accepting and Non-Accepting ".

Please help me............

Thanks 

Comments

what i was thinking

they are saying when i = 1 then that DFA is in q state and since it differ only in ith position it is accepting as well as not accepting because we have two sequences a and b

when i >1 and both the sequences have seen i-1 zero's then at i position again they have to see different symbol (either 1 or 0) therefore this state p must be accepting as well as non accepting
correct me if i m wrong.