Solve this question

Problem 1. (10 points) Write pseudo code to compute log2 n] given any pos- itive integer n 21. What is the time and space complexity using RAM uniform cost model? Problem 2. (5 points) Prove that if a function f(n) is O((n)+h(n) and h(n) is O(g(n)) then f(n) is O(g(n)). Problem 3. (20 points) Define a relation among the functions that map from N to R+ as follows: f(n)