In: Computer Science
***Only Complete the Bolded Part of the Question***
Complete the asymptotic time complexity using Master theorem, then use the "Elimination Method" to validate your solution.
Clue for Last question: you need to use the elimination method to obtain analytical TC first.
1. T(n)= 4T(n/3) + n lg n
2. T(n)= 3T(n/3) + n / lg n
second one i will upload later. a little time needed since it has n/logn. or else please post as seperate question.