Welcome to the practical segment of our Ruby programming journey! Today, we're applying the knowledge from past lessons to solve two practice problems using advanced Ruby data structures: queues and sorted arrays with custom class keys.

Consider an event-driven system, like a restaurant. Orders arrive, and they must be handled in the order they were received, following the First In, First Out (FIFO) principle. This principle makes it a perfect scenario for a queue implementation in Ruby using arrays.

This code demonstrates the creation and operation of a Queue class, which leverages Ruby's array to efficiently implement a queue. The Queue class includes methods to enqueue (add) an item, dequeue (remove) an item, check if the queue is empty, and return the queue's size. Enqueue operations add an item to the end of the array, while dequeue operations remove an item from the beginning, maintaining the First In, First Out (FIFO) principle.