Consider A[] of n distinct numbers such that the smallest number is A[i] for some unknown i, and sequence A[i] < A[i 1] < . . . < A[n-1] < A[0] < . . .< A[i-1]. In other words, A[] consists of two sorted arrays, the larger sorted array is placed before the smaller sorted array. Given such an array A[], return the position of the smallest element in A[].