Let f(n) = 10n^2 + 81n + squareroot n + log_2 n. Prove that f(n) element theta (n^2). Prove that theta (n) + O(n^2) subsetoforequalto O(n^2). Note that for this problem, you are proving that the set of functions on the left hand side (LHS) is a subset of the set of functions on the right hand side (RHS). The set on the LHS is the algebraic sum of two sets (not the union): an element of the LHS has the form f(n) = f_1(n) + f_2(n), where f_1(n) element theta (n) and f_2(n) element O (n^2). Prove that theta(n) + O(n^2) notequalto O(n^2)