task 2 java lang

W04 Lab Recursion, S... CIS 143 - Winter 2021 Page 2 of 5 Task 2. Recursive problem breakdown. (15 points) Create a recursive method to implement binary search all the method from your main program with the following test cases: Array Search for Index returned 15 5 (0,1,2,3,4,5,6,7,8,9) 2 (@.1.2.3.4.5.6.8.2 . 0,1,2,3,4,5,6,7,8,9) se 3.2.2.9) 12 - 3.5,2,92 (3.5,7,9) 3 (2.4.6.8.12) 2 you in here! (2,4,6,8,12) 12 frou fein here (2,4,6,8,12) se Proof here 2,4,6,8,12) Jyou fein here! After each call to Binary Search from the main program.out. 1. The array searched 2. The value searched for 3. The Index returned from BinarySearch Create a table smilar to the sample output from Question Rubric: Student name and today's dutes a comment in the fest line of the programs 5 points if faits Screenshot and program code points if fails BinarySearch algorithm implemented correctores Three arrays and 11 test cases: points Output formatted in a nice tables points Please paste a screenshot of a successful program run and coor-and-paste the source code from your main program' av file here CIS 143 - Winter 2001 Page 3 of 5 Dashboard Calendar To-do Notifications Inbox