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

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

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

What is a potential limitation of array-based stacks?*1 pointa. Limited by the fixed size of the arrayb. Can lead to stack overflowc. Offers dynamic sizingd. Requires additional memory for pointers

Which of the following statements is true regarding std::stack in C++?It is a dynamically resizing arrayIt is a container adapterIt allows random access to elementsIt supports concurrent access

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.