Implement the recursive Binary Search algorithm in the text. Please create, then complete a test plan with at least four cases. run it in the command prompt.

1s* *Performs the standard binary search using two comparisons * per level. This is a driver that calls the recursive method. * return index where item is found or NOT_FOUND if not found public static int binarySearch( AnyType[ a, AnyType x ) return bina rySearch( a, x, 0, a.length-1); Hidden recursive routine private static > int binarySearch AnyType [] a, AnyType x, int low, int high) if low>high) return NOT_FOUND; int mid = ( low + high ) / 2; al mid J.compareTo x 0 if else if a mid .compareTo( x0) else id ; 1, high ); return binarySearch a, x, mid + 1, high return binarySearch a, x, low, mid 1 return nid