How do I solve these? PLEASE HELP!!! THANKS!

Characterize the following recurrence equation using the generalized master theorem (assuming that T(n)=c for n0 and d>=1 ). Note which of the 3 cases in the Master Theorem is used ( 1,2 , or 3). T(n)=9T(3n)+n3logn O ) using case number Use Python syntax without spaces for big O notation: - n2 for n2 - log(n) for logn - log5(n) for log5n - * for multiplication of terms, such as n2log(n) for n2logn What is the maxima set from the following set of points? {(2,1),(8,7),(6,4),(4,2),(9,5),(3,9),(5,3),(1,6),(7,8)} The answer should be a set in sorted order. Do not include spaces in your answer. Question 6 What is the maxima set from the following set of points? {(7,4),(8,8),(5,5),(1,1),(9,6),(3,9),(2,2),(6,3),(4,7)} The answer should be a set in sorted order. Do not include spaces in your answer. Show the return values of the top three levels of the recursion tree for the MaximaSet function in algorithm 4.5.2 using the following set: {(2,7),(8,4),(7,6),(1,8),(6,3),(4,2),(3,5),(5,1)} Level 0 has a single return value. Level 1 has the left and right children returned to Level 0 . Level 2 has the left and right children returned to Level 1. We are ignoring the base case return values. Show all sets in lexicographic order. Do not include spaces in your