Step 1: Define the behavior of a stack.
A stack is a linear data structure that operates like a stack of plates. You can only add a new plate to the top, and you can only remove the top plate.
Step 2: Determine the principle.
The last element added (pushed) onto the stack is the first element to be removed (popped). This principle is known as Last-In, First-Out (LIFO). Option (A) First-In, First-Out (FIFO) describes a queue.