Consider the Sort Method Shown Below for Selection Sort: Public

Multiple Choice

Consider the sort method shown below for selection sort: 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 condition to read i < a.length. What would be the result?
B) The sort would work, but run one more iteration.
C) The sort would work but with one less iteration.
D) The sort would work exactly the same as before the code modification.