Please help me do the Java implementation for this question below!

Modify the code that you converted to Java from the pseudo code of Quicksort algorithm from the textbook (Yes, only use the pseudo code in the textbook). The new version of Quicksort chooses two pivots p1 and p2. All values less than or equal to p1are placed in the first subarray, all values greater than p1 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?

QUICKSORT(A, p, r) 1 ifp