Arrays are always stored on the stack?1 pointYes, but only through making a shallow-copy. Yes, but only through making a deep-copy.No

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.

Where is an array stored in memory?

17. What is the role of the top variable in a stack implementation?a. It stores the value to be pushed.b. It tracks the most recently added element.c. It points to the bottom of the stack.d. It manages the display operation.18. What is a potential limitation of array-based stacks?a. Limited by the fixed size of the arrayb. Can lead to stack overflowc. Offers dynamic sizingd. Requires additional memory for pointers19. In the C++ code for pushing elements onto a stack, what is stack[top] = x; doing?a. Removing the top elementb. Initializing the stackc. Adding an element to the stackd. Checking if the stack is full20. In the C++ code for displaying elements in a stack, what does the loop for(i = top; i >= 0; i--)do?a. Adds elements to the stackb. Removes elements from the stackc. Checks if the stack is emptyd. Displays elements in reverse order

Each time a method is invoked, the system stores parameters and local variables in an area of memory, known as ________, which stores elements in a last-in first-out fashion.   a heap   storage area Correct!  a stack   an array

Where is an array stored in memory?a) heap spaceb) stack spacec) heap space and stack spaced) first generation memory