True or False: A stack implemented with a linked list can dynamically adjust its size toaccommodate an arbitrary number of elements.

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.

In a linked implementation of a stack, a pushed element should be added to the end of the list. 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.

What is the key advantage of a linked list-based stack over an array-based stack?*1 pointa. Constant-time access to elementsb. Fixed size and memory efficiencyc. Dynamic sizing and flexibilityd. Faster push operation

Using the rear of the linked list as the top of the stack is the most efficient way to manage the stack. A. True B. False