sort the following lost using binary sort algorithm

Binary Search Given the following list of values, perform a binary search for the indicated search item. Use the binary search algorithm on pg. 1026 of our textbook. Show the values of first, last and middle, and the number of comparisons made after each iteration of the loop. Your should create a table like the following to show your work, where first and last are the values of the variables at the beginning of the loop, and mid is the midpoint used during that iteration, list[mid] is the value in the list at the midpoint, and No. of key comparisons should be the number of comparisons made during this iteration by the algorithm: Iteration first last mid list[mid] No. of key comparisons 12 Question 8 (5 points) List: I 1, 7,9, 13, 14, 17, 18, 18, 20, 21, 22, 27, 271 18 Searching for value: 13