Consider the following method that processes an array to find the smallest value in the array. The array has a nonzero length and is initialized with int values 1 r is the array to be processed public static int findin (int[] arr) int in some value int index = 0; while (index < arr.length) if (arr[index] < min) minare index]: Index return sin Which replacements) for some value will always result in correct execution of findin? Integer .MAX_VALUE Integer.MIN VALUE arre) I only II only III only I and III only II and III only