e. (3 pts) Suppose we want to prove the following claim directly from the definition of 2(): Claim: 2n2 - 4n = (n?). i. (1 pt) Fill in the blank with the appropriate inequality that states what must be proven: 2n? - 4n = (n) if there exist c>0, n >0 such that for all n 2 no, ii. (2 pt) If we choose c = 1, what is the minimum integer value for n, that would satisfy the conditions of the () definition? n = g. (4 points Use ratios and limits to evaluate the claim below. To earn full credit, you must show all steps required to reach your conclusion. Claim: (3n) is o(n log n). i) (3 points) Evaluation of the claim based on ratios and limits: ii) (1 points) Conclusion: the claim is (circle one): TRUE FALSE