2 Your task is to illustrate the operation of QUICKSORT algorithm on the array A = (57, 70, 97, 38, 63, 21, 85, 68, 76), as follows: (1) select the last element in A[] as the pivot, and execute the operation of PARTITION. After PARTITION, all values in first subarray is less than or equal to all values in second subarray. Place the pivot in a correct position. Recursively call QUICKSORT until pr ), and (2) show the final array sorted 1. QUICKSORT algorithm. QUICKSORT(4A, p, r) 1. ifp