Modify the following Quicksort algorithm. 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 to illustrate how your new version of Quicksort works?

28 public static void Quicksort_1(int array [l, int p, int r)( 29 30 31 32 if (p