The given statement of the stack is true.
What is stack?
A stack is an abstract data type which serves as a collection of elements, with two major operations: Push, which adds an element to the collection, as well as Pop, which removes the most recently added piece that has not yet been removed. A peek operation can also return the value of the most recently added element without altering the stack. The term "stack" refers to a collection of physical goods placed on top of one another, such as a stack of dishes.
Dear student, As we all know, in stack, we use top, which is a stack index.
In push operation top++ (post increment)
In pop operation --top ( pre decrement)
So, by referring to the aforementioned, we can now answer your question.
We want to get to the bottom element, which we can do by utilising the index value.
So, time complexity will be O(1).
Hence option is true.
To learn more about stack
https://brainly.com/question/14913725
#SPJ4
