IGNORE FIRST PICS LOOK AFTER PLZ

F(n)=[217(5)whan=1x2seherwiar tainfrity P6) [(30 pts.) Recurrence solution- Recursion Tree] Consider the following recurrence. We want to find an exact closed form of this equation by using the tree method. T(n)=[28T(2n)+n2whenn=1otherwise a. (5 pts.) Draw out the total work done by this method as a tree. Show the first 3 levels and the last level only. b. (5 pts.) Get an expression for the total work. (sum of recursive and base case) c. (15 pts.) Simplify the expression in (b) to a closed form. Hint: You should use the finite geometric series identity somewhere while finding a closed form. d. (2 pts.) What is the simplified big-O bound for T(n) ? i.e assuming n is very large close to infinity. e. (3 pts.) Use Master Theorem to validate your answer above. Show your work