An array is given which may be any of the 4 cases a.) completely increasing b.) completely decreasing c.) decreasing then increasing d.) increasing then decreasing. Find max in the array. o(log n) solution. Then o(1) solution for 3 cases out of these