Suppose a stack is implemented with just one private field top, which refers to the beginning of the stack. There are no other fields. For example, a stack with three elements would be represented:

Which of the following gives correctly the running time of push and pop in the implementation.

Question $4$ options:

push: linear pop: constant

push: constant pop: constant

push: constant pop: linear

push: linear pop: linearconsider:

for $($int i $=0$; i$<$ N; i$++)$

for $($int j$=0$; j