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.

1. 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.2. True or False: A stack implemented with a linked list can dynamically adjust its size toaccommodate an arbitrary number of elements.3. True or False: In a linked list-based stack, the last element added is the first element to beremoved (LIFO), similar to an array-based stack.4. True or False: The primary advantage of implementing a stack using a linked list is theelimination of memory wastage associated with a fixed-size array.5. True or False: When implementing a stack using a linked list, a pop operation involvesdeleting the element at the end of the linked list, opposite to a push operation, whichinserts a new element at the beginning.

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: A stack implemented with a linked list can dynamically adjust its size toaccommodate an arbitrary number of elements.

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

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