Suppose you are given an array of sorted integers that has been circularly shifted k positions to the right. for example taking ( 1 3 4 5 7) and circularly shifting it 2 position to the right you get ( 5 7 1 3 4 ). design an e cient algorithm for nding k. note that a linear time algorithm is obvious.