Consider the following code segment, which traverses two integer arrays of equal length. If any element of arr1 is smaller than the corresponding (i.e., at the same index) element of minArray, the code segment should replace the element of minArray with the corresponding element of arr1. After the code segment executes, minArray should hold the smaller of the two elements originally found at the same indices in arr1 and minArray and arr1 should remain unchanged.
for (int c = 0; c < arr1.length; c++)
{
if (arr1[c] < minArray[c])
{
arr1[c] = minArray[c];
}
else
{
minArray[c] = arr1[c];
}
}
Which of the following changes will ensure that the code segment always works as intended?
Changing the Boolean expression in line 1 to c <= arr1.length
Changing the Boolean expression in line 1 to c <= arr1.length
Changing the relational operator in line 3 to >
Changing the relational operator in line 3 to >
Removing lines 5–8
Removing lines 5–8
Swapping the positions of line 5 and line 9
Swapping the positions of line 5 and line 9
Removing lines 7–10