IN JAVA

Here is the pseudocode:

9. QUICKSORT (Convert the pseudo code of the QUICKSORT(A,p.r) algorithm on page 171 into executable Java codes. Use a 20-element array with 20 distinct integers as input to sort the array. Test your codes by showing the worst case, best case, and average case respectively (you need to add codes to show the number of execution time ines and display the result of each case.) Modify your code that you converted to Java from the pseudo code of (2 Quicksort algorithm from the textbook (Yes, only use the pseudo code in the textbook). The new version of Quicksort chooses two pivots pl and p2. All values less than or equal to plare placed in the first subarray, all values greater than pl and less than or equal to p2 are placed in the second subarray, and all values greater than p2 are placed in the third subarray. Use the same 20-integer array from (1) to illustrate how your new version of Quicksort works