Let aº = 1, an = 6ªñ−1+3 be the recurrence relation of algorithm A and T(1) 1, T(n) = 2T(n/5)+n be the recurrence relation of algorithm B. 1. Find the solution for both relations using the...

Let aº = 1, an = 6ªñ−1+3 be the recurrence relation of algorithm A and T(1) 1, T(n) = 2T(n/5)+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.