Problem 2. Recall the recursive version of binary search (Algorithm 2.1 in your textbook). The textbook calls it location (a) Consider the following array of integers 24,48, 49,57,69,94, 111, 132, 146 Let's say that we call location(1,9), where S is the array above and -132. When location first starts, low 1 and high-9. Show how the parameter var iables low and high change as location performs the search. b)Let's say that we want to search an array of 1,000,000,000 items using location What is the maximum number of times that the basic operation midow+high) /2 will be performed