Recall that, the algorithm assumes we know or can find the binary expansion of n so that n $=($ ak$-1,$ ak$-2,...,$ a$0)2.$ If the initial values of x and p are $1$ and $11$ respectively, select all the possible values that p will attain at some iteration of the algorithm.