I need help with #1,2,3

Problem 1 (1 point). T(n) is the running time of an algorithms with T(n) = 16n2 + 8n + 1. Prove that T(n) O(n). Problem 2 (2 point). T(n) is the running time of an algorithms with T(n) = 64n + 16n + 1. Prove that T(n) : (a) (n) or (b) O(n) or (c) Both O(n) and O(n) or (d) None of the above Problem 3 (4 points). Find the upper bound of the running times of an algorithms characterized by the following recurrence relation (Hint: use the substitution method): T(n)=2T 1] + Problem 4 (5 points). Use the master theorem to find the asymptotic tight bounds for the running times of the algorithms characterized by the following recurrence relations. For each relation, indicate the case of the master theorem you used to find your solution and explain the reason for which you have used that case