Expected Height of a Skip List

In a skip list with $n$ elements, each element is promoted to the next level independently with probability $p =$$\frac{1}{2}$. What is the expected height (maximum level) of the skip list? Prove that the expected search time is $O(\log n)$.