Find the minimum element in a sorted and rotated array. A sorted array is rotated at some unknown point; find the minimum element in it. Design an algorithm in pseudo code to solve this problem in O(log n). Below are some test cases: input {5, 8, 2, 3, 4) {1, 2, 3, 4) {2, 1} output 2 1 1