11a) Given a real number x and a positive integer k we want to find x ^2 ^k. How many multiplications are needed if the algorithm is just multiplying x by itself the appropriate number of times?

11b) Is there a more efficient algorithm (in regards to number of multiplications) to find x^2^k? Describe the algorithm and how many multiplications are needed in terms of k.

plz do b and Describe the algorithm and how many multiplications are needed in terms of k.