Let A[1..n] be an array of n distinct numbers. Design a worst-case O(n log n) time algorithm to decide whether there is an i such that A[i] is the i-th smallest in the array.