java

8. Consider the following list: 2101745495568859298110 Points 4 Using the binary search, how many comparisons are required to determine whether the following items are in the list? Show the values of first, last, and middle, and the number of comparisons after each iteration of the loop. // Use this code to find the searchitem public static int binarySearch(int]] list, int listLength, int searchItem) \{ int first =0; searchitem =98 searchitem =99