once it' swapped into the partition' locafiguretionthe pivot is in its final resting place all subsequent activity will take place on one side of it or on the otherbut the pivot itself won' be moved (or indeed even accessedagain to incorporate the pivot selection process into our recquicksort(methodlet' make it an overt statementand send the pivot value to partitionit(as an argument here' how that lookspublic void recquicksort(int leftint rightif(right-left < /if size < return/already sorted else /size is or larger double pivot thearray[right]/rightmost item /partition range int partition partitionit(leftrightpivot)recquicksort(leftpartition- )/sort left side recquicksort(partition+ right)/sort right side /end recquicksort(when we use this scheme of choosing the rightmost item in the array as the pivotwe'll need to modify the partitionit(method to exclude this rightmost item from the partitioning processafter allwe already know where it should go after the partitioning process is completeat the partitionbetween the two groups alsoonce the partitioning process is completedwe need to swap the pivot from the right end into the partition' location listing shows the quicksort java programwhich incorporates these features listing the quicksort java program /quicksort java /demonstrates simple version of quick sort /to run this programc>java quicksort app ///////////////////////////////////////////////////////////////