What is the worst case number of compares to perform a 1d range count if the keys are stored in an ordered array and the 1d range search is performed efficiently?

What is the worst case running time of the sweep-line algorithm to find all R intersections among N orthogonal line segments?

Suppose that the keys are stored in a sorted array. What is the order of growth of the running time to
perform range count as a function of N and R ? (N=number of keys and R- number of matches)

Suppose that the points [(3, 3), (1, 5), (4, 4), (5,4), (3, 2), (4, 2) ] are inserted into a 2D Tree in that order. Which of the following
statement is true?