IN JAVA please.

Present an example of using the binary search algorithm with an array. Start by showing an example sorted list of at least 13 and no more than 20 items. The items in the list can be of type char, int, double, or String (your choice). Be sure to show both the indexes and the values stored at each index. For example: [O] 3.5 [1] 4.6 : State the value of the target item you will be searching for. List the values of the low, high and middle indexes for each pass, until the algorithm completes (Note: In your example, the target should not be found on the first pass -- so you must implement at least 2 passes) State the value passed back to the calling method, and how many passes were required to find the target (or how many passes were required to discover that the target was not in the list)