Given a sorted array S of length n that has been circularly shifted by an unknown number of positions. For example, the array might have been shifted from $[1,2,3,4,5,6,7]$ to $[4,5,6,7,1,2,3].$ Design an O$($n log n$)$ algorithm to find the minimum value in the array. Example: Input: S $=[4,5,6,7,1,2,3]$ Output of algorithm on input S: $1($the minimum value$)$