Consider the following correct implementation of the selection sort algorithm: public static...

Consider the following correct implementation of the selection sort algorithm:

public static ArrayList selectionSort(ArrayList arr)

{

int currentMinIndex; //Line 3

int counter = 0;

for (int i = 0; i < arr.size() - 1; i++)

{

currentMinIndex = i;

for (int j = i + 1; j < arr.size(); j++)

{

if(arr.get(j) < arr.get(currentMinIndex))

{

currentMinIndex = j;

}

}

if (i != currentMinIndex) //Line 16

{

int temp = arr.get(currentMinIndex);

arr.set(currentMinIndex, arr.get(i)); //Line 19

arr.set(i, temp);

}

}

return arr;

}

What would be the most effective way to alter this selection sort algorithm so that an ArrayList would be sorted from greatest to smallest value?