We have a sorted array which has been rotated for a random number of times to the right. The goal is to determine the minimum of the array. Develop a divide-and-conquer algorithm that solves this problem in logarithmic time. Write down the pseudo-code and trace it on the following example.

Examples: Input :

Output: Sorted array was (2,4,6,8,9,10,12) and it has {10,12,2,4,6,8,9}; 2 been rotated twice. The minimum is 2.