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

1. What does LIFO stand for in the context of stacks?a. Last-In, First-Outb. First-In, First-Outc. Last-Out, First-Ind. First-Out, Last-In2. Which of the following is a fundamental stack operation?a. Insertb. Removec. Pushd. Shift3. In stack operations, what is the primary check performed before pushing an element onto thestack?a. Check if the stack is emptyb. Check if the stack is fullc. Check if the stack is halfway fulld. Check if the element is greater than the top element4. What error condition is triggered when you attempt to push an element onto a full stack?a. Stack Overflowb. Stack Underflowc. Invalid Operationd. Stack Limit Exceeded5. When you pop an element from a stack, which item is removed?a. The last item addedb. The first item addedc. The item at the middle of the stackd. The item at the bottom of the stackStacks: Linked List Implementation6. In a linked list-based stack, which element is removed when you pop an element?a. The first element addedb. The last element addedc. The element at the middle of the stackd. The element at the bottom of the stack7. What is the key advantage of a linked list-based stack over an array-based stack?a. Constant-time access to elementsb. Fixed size and memory efficiencyc. Dynamic sizing and flexibilityd. Faster push operation8. In the linked list-based stack, which operation adds an element to the stack?a. Insertb. Pushc. Add

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

Which of the following is not part of the pop operation for a stack implemented using a linked list? A. adjust the top reference variable to point to the node pointed to by the next field of the node at the top of the stack B. declare a temporary reference variable and set it to point to the element at the top of the stack C. all of these are part of the pop operation for a stack implemented using a linked list D. determine if the stack is empty E. determine if the stack is full

The book describes the Stack as having a LIFO (Last-In, First-Out) property. Briefly (in one sentence) explain what this property means with respect to items in the Stack data structure.