please do

P1) Given T(n)5n+20, Answer the following asymptotic function reluted problems (30 points) (a) Show the given T(n) is not a (m2) (b) Show the given T(m) is a (n) P2) Answer the following sort related questions ( 30 points) (a) For the "Quick Sort" algorithm, will be there any "Best" or "Worst" case of input format? In other words, what type of input will make the worst/best performance when you apply Quick sort. Clear explanations are required. (b) For the "Insert Sort" algorithm, do you believe that there is any best case for this algorithm? In other words, is there any sequence of input numbers will make the given sort algorithm completed in fewest steps? P4) For the siven binayy search tree, answer the following questions: (30 polati) (a) Insert aumbers in the seguence of 23.24 and 35 into the given tree. (b) From the original tree, delete the key 5,25 and 35 , then stow the result tree