Problem3. (10 points) Binary Search. (Complete Problem Solving Process not required) Implement the recursive Binary Search algorithm in the text. Please create, then complete a test plan with at least four cases. (Screen Capture/s and Completed Test Plan required) figure 7.11 A binary search Perforns the standard binary search using two conparisons * per level. This is a driver that calls the recursive method. Oreturn index where ite is found or NOT FOUND if not found. 6 public static 7int binarySearch AnyType a, AnyType x ) return binarySearch a, x, 0, a.length -1) 12 13 14 15 private static cAnyType extends Conparablec? super AnyType> 16 int binarySearch AnyType a, AnyType x, int low, int high) 17 18 19 20 21 Hidden recursive routine. if low> high) return NOT FOUND int nid (low + high ) / 2; if( a[ nid ].conpareTo( x