1. Write the recurrence relation for the following recursive method:

     ,----
     | void foo(float x, int n){
     |    if(n <= 1) return x;
     |    else return foo(x/2,n-1);
     | }
     `----

  2. Solve the following recurrence relation

     ,----
     | f(n) = { 1          if n < 2
     |          n + f(n/2) otherwise
     `----