Do a worst case analysis of this algorithm, counting additions only (but not loop counter additions) as the basic operation counted, and assuming that n is a power of 2, i.e. that n= 2k for some k>=0. As part of this analysis do the following:

a) [5 points] Write a recurrence relation for the worst case performance.

b) [10 points] Solve that recurrence relation using back substitution, following the method from class. Verify your solution using induction.

c)[1 point] What is the complexity of this algorithm? You just need to state your answer here.

3) [16 points total] Consider the following algorithm: int SillyCalc (int n) int i; int Num, answer; if (n -0. As part of this analysis do the following: a) [5 points] Write a recurrence relation for the worst case performance. b) [10 points] Solve that recurrence relation using back substitution, following the method from class. Verify your solution using induction. c) [1 point] What is the complexity of this algorithm? You just need to state your answer here