Consider the Sort Method for Selection Sort Shown Below: Public

Multiple Choice

Consider the sort method for selection sort shown below: public static void sort (int[]A) An exception would occur

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?
B) The sort would not consider the last array element.
C) The sort would not consider the first array element.
D) The sort would still work correctly.