Question 1 We would like to design an algorithm that computes x" for a real number x and an integer number n. For example, if x = 6.0 and n = 2, the answer will be 62 = 36. Design a divide-and-conquer algorithm for this problem that has an asymptotic running time of O(log n). Assume that multiplying two real numbers is a constant-time operation. Write the pseudo-code of the algo- rithm and analyze its running time using the Master Theorem. Hint: 22n = rn.cn 1. (15 Points) Pseudo-code: 2. (5 Points) Recurrence relation: 3. (10 points) Solve the recurrence relation