Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n22n operations and the second algorithm uses exactly n operations. As n grows, which algorithm uses fewer operations?

A. Given a real number x and a positive integer k. Determine the number of multiplications used to find x^2^k starting with x and successively squaring (to find x^2, x^4, and so on).

B. Is this a more efficient way to find x^2^k than by multiplying x by itself the appropriate number of times?