4. Consider the following list of numbers 5, 12, 25, 32, 38, 46, 58, 62, 85, 9, 97, 105, 110 For each value below, assume you are using binary search to try to find whether the item in the list. For each iteration of the algorithm, fill in a line of the table. Refer to the examples on pp. 1272-1273 of your text book. Note. You may not need all rows of the table. a. 66 IterationSt East mid 1ist [mid] Number of Iteration first last mid list[mid] Number of c. 37 first ist (mid] Number of comparisons Iteration last d. 90 Iterationn first last mid list (mid) Number of comparisons