[5 pts] Suppose you have a circular array of ints, in other words an array that is sorted from least to greatest but where the least element is not necessarily at index 0 of the array. Propose a divide and conquer algorithm to efficiently find the index of the smallest element of the array. Analyze the running time of your algorithm (informally). For simplicity, you may assume that the size of the array is an exact power of 2