An array-based implementation of a stack can be designed so that all stack operations are O(1). A. True B. False

True or False: In a stack implemented using an array, the size of the stack is fixed, andelements can only be added or removed from the top of the stack.

The time complexity of both push and pop operations on a stack implemented with an array is O(1).a.TRUEb.FALSE

Array implementation of Stack is not dynamic, which of the following statements supports this argument?space allocation for array is fixed and cannot be changed during run-timeuser unable to give the input for stack operationsa runtime exception halts executionimproper program compilation

Which of the following is not an operation on a stack?

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?