Java Question:

Do a trace on the binary search method below:variable key holds the value 31, and variable list is a reference to an array with these values {5, 17, 20, 27, 38, 40, 44, 47, 53, 56, 63, 72). public static int binary Search(int[] list, int key) { int lowIndex = 0; int highIndex = list. length 1; while (highIndex >= lowIndex) { int midIndex = (lowIndex + highIndex) / 2; if (key list[midIndex]) { lowIndex = midIndex + 1; } else if (key == list[midIndex]) { return midIndex; } } // end of while loop return -1; } // end of binary search method Each row in the table below corresponds to one iteration of the while loop in the method above. You can add or remove rows according to the actual number of iterations needed. The first row's information corresponds to the first iteration. You need to fill in the first row for the first iteration, then the second row for the second reiteration, so on and so forth, until the loop stops and the method finishes. key 31 lowIndex highlndex highlndex>=lowIndex midIndex key==list[midIndex] key