Problem 1 (15 points) 1. (9 points) Solve the following recurrences without using any method you like. Make sure your solutions are readable and understandable otherwise no points will be awarded. • . T(n)=(n)+1, T(1) = 1 T(n)=27(n/2)+n², T(1)=1 T(n) T(n/2)+T(n/3)+n, T(1)=1. 2. (6 points) Order the following functions by order of growth. If a function f is listed before g then f(n) = O(g(n)). If two functions have the same order of growth then f(n) = (g(n)). For example if fi(n) = 2n and f(n) =n log n then f₁ = O(2) but f₁ = (f), where fa(n) = 2log". Make sure you briefly justify your answers.