Please help solve this problem

1. For each of the following subproblems, there are two functions being compared. Call the first f(n) and the second g(n). Prove whether f(n) is O(g(n)) or not, and also whether it is (g(n)) or not. Note that the requirement is to prove, not just state. (a) 3n+1 vs 3n (b) 22n vs 2 (c) 4" vs 22n d) n' vs n (e) n.9 vs 0.9". 2.01 2. Same instructions as problem 1. (a) log n vs log n, where c is a constant greater than 1. (b) logn vs logn, where c 6(1) (c) log(c n) vs log n, where c(1). You can assume both have the same base. (d) log, n vs log,n, where a and b are constants greater than 1. Show that you understand why this restriction on a and b was given