Suppose you compute

using the algorithm for modular exponentiation discussed in lecture and shown below:

modExp$($b$,$ n$,$ m$)$:

x $=1$

p $=$ b mod m

for i $=0$:k$-1$:

if a$\_$i $=1$:

x $=($x $*$ p$)$ mod m

p $=($p $*$ p$)$ mod m

return x

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.