Question 4 14 Points Let ao = 1, an = 7an-1 + 4" be the recurrence relation of algorithm A and T(1) = 1, Tn) = 3T(n/4)+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