if the input array a of size n (> 1) is reversely sorted and all values are distinct, how many exchanges of elements will be performed by the procedure?