Give a (lg n) algorithm that computes the remainder when xⁿ is divided by p. For simplicity, you may assume that n is a power of 2. That is, n = 2^k for some positive integer k.

Give a (lg n) algorithm that computes the remainder when x" is divided by p. For simplicity, you may assume that n is a power of 2. That is, n = 2k for some positive integer k