c++

Consider the following list: 5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 110 Using the binary search, how many comparisons are required to determine whether following items are in the list or not Show the values of first, last, and middle and number of comparisons after each iteration of the loop. 32 20 Recall the insertion sort algorithm as discussed in this chapter. Assume following list of keys: 30, 20, 35, 27, 96, 82, 60, 48, 75, 5, 80 Exactly how many key comparisons are executed to sort this list using insertion sc Show the values and the number of comparisons after each iteration for the loop. What is the output of the following C + + code