Consider the sort method for selection sort shown below:

public static void sort(int[] a) 

{

   for (int i = 0; i < a.length – 1; i++)

   {

      int minPos = minimumPosition(i);

      swap(minPos, i);

   }

}

Suppose we modify the loop control to read int i = 1; i < a.length – 1; i++. What would be the result?