In the algorithm SELECT that we have discussed in chapter 9, input elements are divided into groups of 5. a) Will the algorithm works if they are divided into groups of 7? Prove your claim by arriving at the running time similar to the recurrence we got for group size 5 during the lecture b) Show that SELECT does not run in linear time if groups of 3 are used Show that quick sort can be made to run O(n log n) time in the worst-case. Assume that all elements are distinct. a) Write your algorithm that run quick sort can be made to run O (n log n) time b) Write the recurrence that shows the running time of your algorithm in (a) above c) Briefly explain no need to prove) how your recurrence records O (n log n) time in worst-case