Let A be an array of n distinct integers. Assume that the integers in A are sorted, i.e. A[i] < A[j], where 0 <= i < j < n. The algorithm count(x, y) returns the number of integers in A which are greater than x and less than y, where x < y. For example, if A = {5, 10, 33, 49, 66, 75, 82, 95, 100}, then count(47, 85) returns 4.
Describe a most efficient algorithm to implement the algorithm for count(x, y). Derive the time complexity for your algorithm.