O(n2). Show Given f(n) = 3n + 2n2 + 10, use the definition of Big-O to prove f(n) clearly the steps of your proof. * Use definition, not properties of Big-O. B2 [5 marks] Suppose function F() requires H units of time to be executed, where H is a constant. i) Find the complexity T(n) of the Python code segment below, where n is the size of the input data. Explain your answer. i) What is its Big-O representation based on the properties of Big-O? Indicate the properties of Big-O you have applied, if any. for i in range(n): for j in range(n): FO) for k in range(n): FO)