Divide-and-Conquer Algorithm | Definition, Approach & Example

SOLVED:a) Set up a divide-and-conquer recurrence relation for the number of multiplications required to compute x^n , where x is a real number and n is a positive integer, using the recursive algorithm from Exercise 26 in Section 5.4 . b) Use the recurrence relation you found in part (a) to construct a big- O estimate for the number of multiplications used to compute x^n using the recursive algorithm.