Q1) i) Here is the recurrence relation of an algorithm n=1 5. T(n) = {T(n-1) + 2n, n> 1 a)Calculate the time complexity T (n) of the recurrent relation! If known: 1-1 1-1 1-1 2 C2(n k) = 2n 1-2X* ko ko ko b) determine the asymptotic complexity of the recurrent relation! Prove it by giving the values c and no ! ii) Sort the functions in the following n based on order of growth. Give an explanation for the sorting you are doing a) 226 b) Vns C) 0.001n* + 3 cos(n) d) (n-1)! e) 3" f) Sig(n + 100)