Exercise 2 addressed stable sorting. Write a method that performs a stable quicksort. To do so, create an array of objects; each object is to contain a data item and its initial position in the array....

Exercise 2 addressed stable sorting. Write a method that performs a stable quicksort. To do so, create an array of objects; each object is to contain a data item and its initial position in the array. (This is the Composite pattern.) Then sort the array; if two objects have identical data items, use the initial position to break the tie. After the array of objects has been sorted, rearrange the original array.