(Binary Search) Use Binary Search to search for the numbers 2, 43, and 70 in the sequence

2 5 11 17 19 21 26 33 39 43 51 65 79 88 99

Show for each iteration which item is selected and which part of the sequence remains. (Hint: Use the code on P380 (recursive) or P381 (iterative) of Sedgewick et al.)

OR

public int rank Key key, int lo, int hi) it Chi lo) return To int mid loo Chi lo) 2 int cmp key compareTo Ckeys mid]) if Cmp 0) return rank (key, lo, mid-1) else if (cmp 0) return rank key, mid-1, hi); e lse return mid Recursive binary search