If the Sort algorithm is applied to the input list (7, 6, 5, 3, 4, 1, 2) how many exchanges are performed between elements in this input list? List each swap in the order in which it is made during the execution of the algorithm. Note that we are not talking about comparisons here, but rather only comparisons that result in an interchange.

Sort is the following algorithm (which you may assume is correct), called initially with i = 1 and j = n to sort a list of n numbers in an array A:

Sort(A, i,j) 00 N O UN A W N if A[i] > A[j] then exchange A[i] = A[j] if i + 12j then return ke[(i-i+1)/3] Sort(A, i,j - k) Sort(A, i+k, j) Sort(A, i,j - k)