Consider the function f(n) = 3n3-39n2 + 360n + 20. In order to prove that f(n) is (n*), we need constants c, no >0 such that f(n) 2 cn3 for every n 2 no. Show your work for each part. Work should include any steps you performed to solve the problem (e.g., derivations, arithmetic, " entered this into Wolfram Alpha"...). (3 points each for 12 total) 1. Suppose we fix c = 2.25, what is the smallest integer value of no that works? Suppose we fix c-3. Now what is the smallest integer value of no to satisfy the inequality? Suppose we want to fix no-1. Provide some value of c that satisfies the inequality. Provide a value of c such that no matter what value no takes, the inequality cannot be satisfied. a. b. c. d