P/S: PLEASE DO NOT USE ANY PROGRAMMING LANGUAGE OR CODING, THIS ANSWER NEED TO USE HANDWRITING BECAUSE THIS IS DATA STRUCTURE

1. Consider the following list: 's','u', 'b', 'd', 'e', 'r', 'm', 'a', 't', 'o', '8', '', 'y', 'p', 'h', 'c' i) Using the binary search algorithm, show the steps to find the following items. How many comparisons are required to find whether the items are in the list? Show the values of first, last and middle and the number of comparisons after each iteration of the loop. a) 'c' b) 'f