Question 4 14 Points Let o = 1. an = 3n-1 + 3 be the recurrence relation of algorithm A and T(1) = 1. T(n) = Tn/5)+n be the recurrence relation of algorithm B. 1. Find the solution for both relations. Use any method. 2. Without proof, find Big-Oh for both algorithms. 3. Which algorithm is faster? Justify your answer using Big-Oh notation. Use the editor to format your onswer