I am looking for url and examples that will help me calculate the following:-> Formulas
f(n) = n if n <= 1;
f(n) = n + f(1/2 * n) if n is even, n > 1;
f(1/2 (n+1) )+ f(1/2 (n-1)) if n is odd, n > 1;
Draw the recursion tree and calculate the value of f(n) for n=5.
What is meant by determine the approximate space and time requirements for algorithms. -> How???