Consider the recursion tree for the recurrence: T(n)=2T(n/2)+n Suppose n=512. a. How many nodes will this tree have at level 3? b. How much work will be performed inside each of the nodes at level 2? c. What is the total amount that will be performed inside the nodes at level 4 ? d. How many levels will this tree have (not counting the leafs level)? e. How many leaves will this tree have? f. How much work is performed inside each leaf? g. What is the total amount of work performed inside all of the non-leaf nodes