1. If a linear search function is searching for a value that is stored in the last element of a 10,000-element array, how many comparisons will the search function have to make to locate the value? 2. Given an array of N elements, what is the average number of comparisons a linear search function will make to locate a specific value? 3. Assume that a binary search function is searching for a value that is stored in the middle element of an array. How many times will the function read and compare elements in the array before it finds the value? 4. What is the maximum number of comparisons that a binary search function will make when searching for a value in an array that contains 1,000 elements? 5. Why is a binary search function almost always more efficient than a linear search function?