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)=O(f(n)). a) T(n)=4T(n/2)+n for n>1 and T(1)=1 2 b) T(n)=5T(n/2)+n for n>1 and T(1)=1 c) T(n)=T(n/4)+n2 for n4 and T(n)=1 for 1n3 d) T(n)=2T(n/4)+1 for n>1 and T(n)=1 for 1n3 e) T(n)=T(n/2)+1 for n>1 and T(1)=1