Suppose we had a sorted array A[1 .. n) of n distinct numbers. But when we were unaware, an intruder got access to it and cyclically rotated our array k steps, for some unspecified integer k between 1 and n-1. The current array configuration is such that the prefix A[1 .. k) is sorted in increasing order, the suffix A[k+1 .. n] is sorted in increasing order, but A[n]