can you please send me answer for all of these questions asap

Question 3 (20 points) Let f(n) and g(n) be asymptotically nonnegative functions. Show that f(n) + g(n) = 0(max(f(n), g(n)). Show your work and give specific values for c and no. Hint: For a given n, max(f(n) g(n)) is f(n) if f(n) g(n), otherwise it is g(n). Question 4 (10 points) Show that the solution of T(n) = T(n-1) +n is O(n). Do not use the Master Theorem. Question 5 (10 points) Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 3T(n/3) + n. Use the substitution method to verify your answer. Question 6 (20 points) Solve the following recurrences using the Master Theorem. T(n) = 2T (3/4) +1 T(n) = 2T(n/4) + Vn T(n) = 2T(/4) +n T(n) = 2T (n/4) + n2