Solve and Explain in detail. Thanks!

Then, the recurrence for the running time was T(n) = T({n) +T(on) + O(n) (Can you explain why?) Now suppose we change the algorithm as follows. (a) Divide the n elements into groups of size 7. So n/7 groups. (b) Find the median of each group. (e) Find the median r of the n/7 medians by a recursive call to Select. (d) Call Partition with x as the pivot. (e) Make a recursive call to Select either on the smaller elements or larger elements (de- pending on the situation); if the pivot is the answer we are done. Now what is the recurrence you obtain? Explain. Then, the recurrence for the running time was T(n) = T({n) +T(on) + O(n) (Can you explain why?) Now suppose we change the algorithm as follows. (a) Divide the n elements into groups of size 7. So n/7 groups. (b) Find the median of each group. (e) Find the median r of the n/7 medians by a recursive call to Select. (d) Call Partition with x as the pivot. (e) Make a recursive call to Select either on the smaller elements or larger elements (de- pending on the situation); if the pivot is the answer we are done. Now what is the recurrence you obtain? Explain