after partition in simple version of quicksortthe pivot may be used to find the median of the array exchanged with an element of the right subarray used as the starting point of the next partition discarded median-of-three partitioning is way of choosing the in quicksortfor an array of elementsthe partitionit(method will examine each element approximately times true or falseyou can speed up quicksort if you stop partitioning when the partition size is and finish by using different sort experiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved find out what happens when you use the partition workshop applet on inversely sorted bars is the result almost sorted modify the shellsort java program (listing so it prints the entire contents of the array after completing each -sort the array should be small enough so its contents fit on one line analyze these intermediate steps to see if the algorithm is operating the way you think should modify the shellsort java (listing and the quicksort java (listing programs to sort appropriately large arraysand compare their speeds alsocompare these speeds with those of the sorts in programming projects writing programs that solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied (as noted in the introductionqualified instructors may obtain completed solutions to the programming projects on the publisher' web site modify the partition java program (listing so that the partitionit(method always uses the highest-index (rightelement as the pivotrather than an arbitrary number (this is similar to what happens in the quicksort java program in listing make sure your routine will work for arrays of three or fewer elements to do soyou may need few extra statements