1. Develop a program to implement the binary search algorithm. This technique compares the search key value with the value of the element that is midway in a “sorted” list. Then;
(a) If they match, the search is over.
(b) If the search key value is less than the middle value, then the first half of the list contains the key value.
(c) If the search key value is greater than the middle value, then the second half contains the key value. Repeat this “divide-and-conquer” strategy until we have a match. If the list is reduced to
one non-matching element, then the list does not contain the key value.
Use the sorted list created in Exercise 9.9 or use any other sorted list.