3. Suppose g(n) 2 1 for all n, and that f(n) sg(n)+L, for some constant L and all n. Prove that f(n) O(g(n)). 4. Prove or disprove: if f(n) O(g(n)) and f(n) 21 and log(g(n)) 2 1 for sufficiently large n, then log(f(n)) O(log(g(n))). 5. Show that log(n!) (n log n)