1. 4+6 Write a recursive method to conduct binary search on a given array. Show how the algorithm works by simulating a step-by-step search of the item 25 in the following array: [2, 8, 11, 17, 21, 25, 32, 39] 2. 5+5 For the given array, simulate the working operation of Merge Sort. Show your work at each step. In particular, show how the array will be divided, and then how the results will be merged. [ 28, 13, 22, 7, 34, 2, 15, 18] For the same array as above simulate the working operation of Selection Sort. [Note: Show only the major operation]