If the top of the stack is the first entry of the array what is the complexity for pop() in big Oh notation? You can assume the stack is using a fixed-length array.

• O(log n)
• O(1)
• O(n^2)