Recurrence, Master Theorem, and Recursive Tree: Consider the following recurrence

T(n)= 4T(n/2) + 5n2

i.) a) How many sub problems are in the above recurrence? b) What the size of each of the sub problems identified above?

c) What is the work/time needed for non-recursive part (divide an combine) of the recurrence?

ii) Use the recursive tree technique to obtain the running time (time complexity) of the above recurrence?

iii) Use the mater theorem to determine the time complexity of the above recurrence.