a.) Set up a divide-and-conquer recurrence relation for the number of multiplications required in the recursive algorithm.

b.) Find the big-O estimate for the number of multiplications used in the recursive algorithm

Consider following recursive algorithm for computing an, where a is a real number and n=2k for a nonnegative integer k. procedure power (n : positive integer and power of 2,a : real number ) if n=1 then return a else x=power(n/2,a) return xx