The Stack Protocol (LIFO)

The Undo Mechanism (LIFO)

A Stack is a fundamental data structure modeled after a real-world stack of plates. It follows the LIFO (Last-In, First-Out) principle: the last item you place on the stack is the very first one you take off. This is exactly how the "Undo" button in your text editor works!

The Assignment

Your mission is to simulate a basic stack processor. Your function receives an array of commands and an array of values.

1. Initialize an empty array to serve as your internal stack.
2. Iterate through the commands array:
   • If the command is "PUSH", add the corresponding value from values[i] to the top of the stack.
   • If the command is "POP", remove the top element and print it.
   • If the command is "PEEK", print the top element without removing it.