If the top of the stack is the last element in the array what is the complexity for push(newEntry) in big Oh notation? You can assume the stack is using a fixed-length array.

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

There are no hints for this question