Problem 4. (20 points) Suppose that in an array A of length n all elements are distinct and sorted in decreasing order. Describe how the algorithm quicksort(A, 1, n) discussed in class works on this array. What partitions are produced during the execution of this algorithm? What is the running time of the algorithm quicksort() for this array in terms of ? Give detailed explanations to your answers