Learning Objective: For the student to demonstrate that he or she understands how the recursive binary search algo- rithm works. 4.2 Instructions: This question is not graded, but if you wish, you may include your solution in your word processing document. Problem: Suppose list is an ArrayList of Integers and contains these elements (note that list is sorted in ascending list 2, 3, 5, 10, 16, 24, 32, 48, 96, 120, 240, 360, 800, 1600 h and we call the recursive binary search method, discussed in the lecture notes: int index-recursiveBinarySearch(list, 10, 0, list.sizeO-1); where 10 is the key, 0 is the index of the first element in the range of list that we are searching (this becomes pLow) and list.size)- 1 is the index of the last element in the range of list that we are searching (this becomes pHigh). Trace the method by hand and show the following: (1) The values of pLow and pHigh on entry to each method call; (2) The value of pMiddle that is computed; (3) State which clause of the if-elseif-elseif statement will be executed, i.e., specify if return middle; will be executed, or if return recursiveBinarySearch (pList, pKey, pLow, middle - 1); will be executed, or if return recursiveBinarySearch (pList, pKey, middle 1, pHigh) wll be executed (4) After the method returns, specify the value assigned to inder and the total number of times that recursiveBin- arySearch) was called, including the original call shown above. 4.3 Repeat Exercise 4.2 but this time let pKey be 150. This exercise is graded, so include your trace in the word process- ing document