Suppose we are given an array, A, of n nonintersecting segments, s₁, s₂,...,s_n, with endpoints on the lines y = 0 and y = 1, and ordered from left to right. Given a point q with 0 < y(q) < 1, design an algorithm that in O(log n) time computes the segment s_i of A immediately to right of q, or reports that q is to the right of all the segments.