Write a recursive program that sorts an array of Comparable objects by using, as a subroutine, the partitioning algorithm described in the previous exercise: First, pick a random element \(v\) as the partitioning element. Next, partition the array into a left subarray containing all elements less than \(v\), followed by a middle subarray containing all elements equal to \(v\), followed by a right subarray containing all elements greater than \(v\). Finally, recursively sort the left and right subarrays.