Exercise 16 marks a) Prove that running time T(n=n3+30n+1 is O(n) [1 mark]- b) Prove that running time T(n)=(n+30)(n+5) is O(n?) [1 mark] - c) Count the number of primitive operation of algorithm uniquel on page 174 of textbook, give a big-Oh of this algorithm and prove it. [2 mark] - d) Order the following function by asymptotic growth rate [2 mark] - a. 4nlogn+2n- b. 3n+100logn- c. n2+10n- d. n e. nlogn- Using Java