Implement the following method in parallel to sort a list using quick sort (see Listing 23.7).public static void?parallelQuickSort(int[] list)Write a test program that times the execution time for a list of size 9,000,000 using this parallel method and a sequential method.

Listing

I public static void quickSort(int[] list) { if (list.length > 1) { select a pivot; partition list into listl and list2 such that 4 all elements in listl pivot; pivot quickSort(list1); quickSort(list2); list2 10 } listi nO70 90