2. How to obtain the upperbound from this recurrence relation? I know the answer is O( n^(k^2) ) but I can't seem to remember how I got that answer.

4. How to find the statements? I wasn't sure of how to start on this one. I know that using the Master Method isn't enough to find big-oh, big-omega, and theta as that only gives you big-oh.

7. I know the answer is n^101 but I'm not sure how to prove it. I barely recall how that was done in my group.