Problem 5 (3+3+3+3+3=15 marks] Estimate the complexity of functions T() specified with the following recurrent relations. For each T(n) you must find the function f(n) such that T(n) = 0(f(n)). a) T(n) = 2T (n/2) + n for n >1 and T(1) = 1 b) T(n) = T(n/2) + n for n > 1 and T(1) = 1 c) T(n) = T(n/4) + n for n >1 and T(1) = 1 d) T(n) = 2T (n/4) + 1 for n > 1 and T(1) = 1 e) T(n) = T(n/2) + 1 for n >1 and T(1) = 1