Please show the work as to how you do this and not just the answer

Give a big-O estimate for each of these functions. For the function g in your estimate that fin) is O(g(n)) use a simple function g of the smallest order (i.e., the tightest upper-bound). Briefly justify why f(n) is O(g(n) (you do not need to argue why the g you picked is the smallest order/ tightest upper-bound) n4+1 a. b. (n3 + c (5"+n2 n2 log(n)) (log(n) + 1) + (8 log(n) + 6) (n3 + 4) (2n)