For each of the following recurrence relations, determine the runtime T(n) complexity. Use the Master Theorem to solve the recurrence relations if the recurrence relations can be solved using Master Theorem, otherwise use expansion (or recursive substitution) to solve the recurrence relations. You must show all your working to justify your answer. Solution without clear justification or steps scores no mark. (a) T(n)=2T(2n)+nlog2n, and T(1)=1 (4.0 marks) (b) T(n)=16T(4n)+n, and T(1)=1 (4.0 marks) (c) T(n)=4T(4n)+n2+n, and T(1)=1 (4.0 marks) (d) T(n)=4T(2n)+n4, and T(1)=1 (4.0 marks) (e) T(n)=T(n1)+n, and T(1)=1. (4.0 marks)