Question 4 14 Points Let 20 = 1, an = 5an-1 + 3" 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. 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 answer Question 5 4 Points Suppose a graph G is connected with n vertices and e edges. If n 3 and G has exactly one cycle prove that e=n. Use the editor to format your