Algorithm Design and Analysis Class Problem

You are given a unimodal array of n distinct elements meaning that its entries are in increasing order up until its maximum element after which its elements are in decreasing order. Give an algorithm to compute the maximum element of a unimodal array that runs in O$($log n$)$ time. Explain why the algorithm has that running time.