Help Asap!! Need test plan too!!

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 Hnary search 2Performs the standard binary search using twe cosparisons * per level. This fs a driver that calls the recursfve nethod @return index where ite" is found or NOT-FOUND if not found. s public static Anylype extends Conparablec? super AnyTypes int binarySearch( AnyType ] a. AnyType return bi narysearch( x. 0, a.length -1 ); * Hidden recursive routine s private static nyType extends Comparablec? super AnyType a, AnyType x,int ow, int high ist binarySearch nyType Cow>high 17 return NOT,FOUND int nid (low+high)2i if( a[ nid ]. coepareTo( x )