Question 1:

Outline an algorithm to compute 5h in O(log(n)) time. Hint: Power(n) If n=0 return 1 Else If n=1 return 5 Else If n is even x=Power(n/2) return x^2 Else If n is odd x=Power(n-1/2) return 5.x^2 Now derive the time complexity. One way of doing this is to write a recurrence relation and solve it