For this problem, we want to implement a binary search algorithm. In computer science, a binary search or half-interval search algorithm finds the position of a specified input value (the search "key") within a list sorted by key value. In each step, the algorithm compares the search key value with the key value of the middle element of the list. If the keys match, then a matching element has been found and its index, or position, is returned. Otherwise, if the search key is less than the middle element’s key, then the algorithm repeats its action on the sublist to the left of the middle element or, if the search key is greater, on the sublist to the right. If the remaining list to be searched is empty, then the key cannot be found in the list and a special "not found" indication is returned. A binary search halves the number of items to check with each iteration, so locating an item (or determining its absence) takes logarithmic time. A binary search is a dichotomic divide and conquer search algorithm. Develop a function called binary search that accepts two parameters, a sorted list of numbers and a number to search for. The function should implement the binary search Page 3 Exam 2 IENG 331 - Spring 20 algorithm. If the requested value is found in the provided list, its index should be returned, otherwise, a ValueError should be raised.