Question 4 12 Points Let ao = 1, an = 5an-1 + 3h be the recurrence relation of algorithm A and T(1) = 1, T(n) = 3T(n/2)+n be the recurrence relation of algorithm B. 1. Find the solution for both relations using the Characteristic Polynomial 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