6.What task is performed by the following algorithm? A: array of numbers low: lowest index of array A high: highest index of array A 1 123in100 4 5 6 7 8 9 10 11 12 function X(A, low, high) elem=A[high] i low for isj high if A[j] elem then swap (A[i],A[j]) i=i+1 end if end for swap (A[high],A[i]) return i end function merge in mergesort none of the others pos_min in selection sort a new sorting algorithm partition in quicksort