Draw memory diagrams that depict, step by step, the

changes to the queue data structure when

$10,20,$ and $30$ are enqueued on an initially empty queue

o dequeue is called three times on a queue that contains

$10,20,$ and $30$