3. Suppose you are given a sorted array of n distinct numbers that has been rotated k steps, for some unknown integer k between 1 and n1. That is. you are given an array All, n such that the prefix A[1,... k] is sorted in increasing order, the suffix Alk +1,... ,n] is sorted in increasing order, and An]