1. Which function grows faster: N log N orN1+?/ log N, ? > 0?

2. Solve the recurrence relation. Show your work.

     T(n) = T(n-1)+2, T(1) = 1

Using the formula below, answer questions 1 and 2.

f(x) =   3         , x <= 1         2×f(x-1)+5, x > 1

1. Solve for f(5). Show your work.
2. Write a recursive function using pseudocode or C/C++.