Write pseudo code to compute [log2n] given any positive integer N 0 but nc is not O(log n).

Write pseudo code to compute [log2n] given any positive integer N<=1. What is the time and space complexity using RAM uniform cost model ? Problem 2. (10 points) Prove that if a function f(n) is o(g(n)) then f(n) is O(g(n)). Note that vice-versa is not true. Using this fact prove that log n is O(nc) for any real constant c > 0 but nc is not O(log n).