Which operation in a stack causes it to grow in size?push()pop()top()empty()

A stack is implemented with an array of 'A [0..N - 1]' and a varlable 'pos'. The push and pop operations are defined by the following code.push(x) A[pos] ← X pos ← pos - 1end pushpop( ) pos ← pos + 1 return A[pos]end popWhich of the following will initialize an empty stack with capacity N for the above Implementation?

Which of the following functions can be used to check if a stack is empty in C++?empty()size()top()pop()

Consider the following operation performed on a stack of size 5.Push(1);Pop();Push(2);Push(3);Pop();Push(4);Pop();Pop();Push(5);After the completion of all operation, the no of element present on stack are

In an array implementation of a stack, we can include code that will automatically allocate more memory if every element of the array is occupied. Which stack operation should invoke this code? A. push B. pop C. peek D. poke E. none of the above

actually i didnt define the stack size how can i decide if a stack is empty or full?