The Queue Protocol (FIFO)

The Waiting Line (FIFO)

A Queue is modeled after a real-world waiting line. It follows the FIFO (First-In, First-Out) principle: the first person to join the line is the first one to be served. Think of a printer handling documents or customers waiting at a store.

The Assignment

Your mission is to build a queue manager. Your function receives an array of commands and corresponding values.

1. Initialize an empty array to serve as your internal queue.
2. Iterate through the commands:
   • If the command is "ENQUEUE", add the value to the back of the queue.
   • If the command is "DEQUEUE", remove the element from the front and print it.
   • If the command is "FRONT", print the front element without removing it.