Implement the following modification of the quicksort algorithm, due to Bentley and McIlroy. Instead of using the first element as the pivot, use an approximation of the median.

=======================================================================================

If n 7, use the middle element. If n 40, use the median of the first, middle, and last element. Otherwise compute the pseudomedian of the nine elements a[i * (n - 1) / 8], where i ranges from 0 to 8. The pseudomedian of nine values is med(med(v0, v1, v2), med(v3, v4, v5), med(v6, v7, v8)).

=======================================================================================

Compare the running time of this modification with that of the original algorithm on sequences that are nearly sorted or reverse sorted, and on sequences with many identical elements. What do you observe?

Please put proper documentation into the program explaining each part of the code, as it is necessary for me to have. I am coding in Java!