please explain your answer

Question 1: You want to find the number 41 in the following sorted array. Using binary search from lecture, what are the recursive calls that are made if the array contains the following integers: 3 614 15 18 20 22 35 37 39 404145 57 60 62 binarySearch (0, 15) List the recursive calls until the recursion terminates: Question 2: Now assume linear search is conducted on the array in question 1. How many items in the array are examined before linear search returns