Q:Question:design of anal of algorithm 7.1-4 How would you modify QUICKSORT to sort into nonincreasing order? 7.2-2 What is the running time of QUiCKsorT when all elements of array A have the same value? 7.2-3 Show that the running time of QUICKSORT is ?(n^2) when the array A contains distinct elements and is sorted in decreasing order.A:Answer:See a step by step answer