Question 4 (30 points) Proof: 1) Prove that 2n+1n3+2n is O(n2), show the c and n0 values. 2) Prove that (n+3)3=(n3), show the c and n0 values. Question 3 (20 points) Order the following functions into a list such that if f(n) comes before g(n) in the list then f(n)=(g(n)) : n,2n,nlog2n,n3,log2n,n2+log2n 2) John tells you that a certain algorithm runs in time (n2+200n), and Bill tells you that the same algorithm runs in time (n3). Assume that both statements are correct, which one is more informative, i.e., gives you a better estimation of the running time? Why