4. (3.5 marks) Consider the following algorithm. Algorithm proc(A, n) if n=1 then return else { proc(4, n 1) for it 1 to n - 1 do A[i] + A[i] + i } The time complexity of this algorithm is given by the following recurrence equation: f(1) = Co f(n) = f(n-1)+ci(n-1)+cy, for n > 1 where Co, C1, and C2 are constants. Solve the recurrence equation and give the order of f(n). You must explain how you solved the equation