Need 3/3 please give correct answer choices with explanation!

Suppose you compute 11644mod645 using the algorithm for modular exponentiation discussed in lecture and shown below: modExp(b,n,m): x=1 p=bmodm for i=0:k1: ifa=1: x=(xp)modm return x Recall that, the algorithm assumes we know or can find the binary expansion of n so that n=(ak1,ak2,,a0)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. 451 221 11 1 391 226 121