PLEASE OUTPUT TO A NICE TABLE

5 9 @ Task 2. Recursive problem breakdown. (15 points) Create a recursive method to implement binary search. Call the method from your main program with the following test cases: Array Search for value Index returned (0,1,2,3,4,5,6,7,8,9) 5 9 (0,1,2,3,4,5,6,7,8,9) (0,1,2,3,4,5,6,7,8,9) (@,1,2,3,4,5,6,7,8,9) 10 -1 (3,5,7,9) 2 (3,5,7,9) 3 (3,5,7,9) 9 3 (2,4,6,8,12) 2. [you fill in here] (2,4,6,8,12) 12 [you fill in here] (2,4,6,8,12) 10 [you fill in here) (2,4,6,8,12) -5 [you fill in here] After each call to BinarySearch from the main program, output: 1. The array searched 2. The value searched for 3. The index returned from BinarySearch Create a table similar to the sample output from question 1. Rubric: Student name and today's date is a comment in the first line of the programs: -5 points if fails Screenshot and program code: -5 points if fails Binary Search algorithm implemented correctly: 3 points Three arrays and 11 test cases: 8 points Output formatted in a nice table: 4 points Tu neram run, and copy-and-paste the source coue inom your