Question 5: Let Al.. n] be a sorted array containing n real numbers, such that and let be a real number such that Binary search returns an index i such that Al or the special value nil if r does not occur in A. The running time of binary search is O(logn). Recall that the pseudocode for binary search contains the line i.e., the algorithm uses division Design an algorithm that only uses addition, subtraction, and comparisons, and that returns, in O(log n) time, an index i such that Ali]-z or the special value nil if z does not occur in A. In other words, you are not allowed to use multiplication or division Hint: Use the previous 2 questions