You are given a sequence of n numbers A(1), , A(n), with a very special property, that adjacent numbers are off by no more than 1. For example, here is a valid sequence: [100, 99, 99, 98, 99, 100, 100, 101, 102, 103, 104, 105, 104, 103, 103, 103, 102]. Say the first number in the sequence is x, the last one is y, and you are given a number z, such that x < z < y . You have to find the location of z in the sequence (or report that it does not exist). If the element z appears more than once, you are free to report 48 | ANALYSIS AND DESIGN OF ALGORITHMS any location you choose. The time complexity of your algorithm should be O(log n) or better.