Design an algorithm for computing for any positive integer n. Besides assignment and comparison, you may only use the four basic arithmetical operations (+, -, , ). Write the algorithm as pseudocode. What is the time complexity of the algorithm? Is it possible to design the algorithm so that it uses O(log n) multiplications (or even fewer)?

Thanks