Java code.

FOR THUMBS UP:

JAVA CODE ONLY

DATA OUTPUTS TO A ORGANIZED TABLE

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: Index returned Search for value Array 5 5 (0,1,2,3,4,5,6,7,8,9) 9 9 (0,1,2,3,4,5,6,7,8,9) (0,1,2,3,4,5,6,7,8,9) - 1 10 (0,1,2,3,4,5,6,7,8,9) -1 2 (3,5,7,9) (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