Suppose you are given an array Al1...n] of distinct numbers that you are told satisfies for some unknown. Such an array is known as unimodal (with the mode being a minimum). Give an O(log n) time algorithm for finding the min imum item Ali] in such an array. As an example, in the array below, the minimum item is 4. 9 5 4 6 8 12 14 To get full marks you must fully describe your algorithm (pseudocode is fine), explain why it returns a correct answer and show why it runs in Oog ) time