Problem 2: Binary search (6 points) See code appendix for binary search code from lecture (if you want it for reference) Suppose array a contains the following integers Suppose binary search is called: binary search (10, a, 0,9) What are the rest of the recursive calls to binary search. If there are too many in the list, just leave them blank arr(midjis binary-search ( 10, a, binary search (10, a binary-search ( 10, a, binary-search ( 10, a, binary search (10,a binary-search 10, a, --, arr(midjis -, arr [mid) is arrtmid)is arr(mid)is -, -, -, -) , binary-search ( 10, a, binary-search ( 10, a, binary searoh (10, a binary seareh (1O,a binary," search ( 10, -, arr(midis