Figure 1

Enter Action Code (? for help): ?

   The action codes are:
        ? - Produces this help message
        E - Exit this program
        A - Add a new node to the tail
        D - Remove head node
        L - List all entries in the queue
        M - List contents of queue array

Enter Action Code (? for help): a

   Enter new node's value: Fred

   Node added

Enter Action Code (? for help): a

   Enter new node's value: Mary

   Node added

Enter Action Code (? for help): a

   Enter new node's value: Pauline

   Node added

Enter Action Code (? for help): a

   Enter new node's value: John

   Node added

Enter Action Code (? for help): 1

   Queue nodes are as follows:
        Node 1 => Fred
        Node 2 => Mary
        Node 3 => Pauline
        Node 4 => John

Enter Action Code (? for help): m

   [1] is head_node, [4] is tail_node

   Queue array nodes are as follows:
        [1] => Fred
        [2] => Mary
        [3] => Pauline
        [4] => John
        [5] =>
        [6] =>

Enter Action Code (? for help): d

   Node removed

Enter Action Code (? for help): d

   Node removed

Enter Action Code (? for help): 1

   Queue nodes are as follows:
        Node 1 => Pauline
        Node 2 => John

Enter Action Code (? for help): m

   [3] is head_node, [4] is tail_node

   Queue array nodes are as follows:
        [1] =>
        [2] =>
        [3] => Pauline
        [4] => John
        [5] =>
        [6] =>

Enter Action Code (? for help): a

   Enter new node's value: James

   Node added

Enter Action Code (? for help): a

   Enter new node's value: Thomas

   Node added

Enter Action Code (? for help): a

   Enter new node's value: June

   Node added

Enter Action Code (? for help): a

   Enter new node's value: Amy

   Node added

Enter Action Code (? for help): a

   Queue is full

Enter Action Code (? for help): d

   Node removed

Enter Action Code (? for help): 1

   Queue nodes are as follows:
        Node 1 => John
        Node 2 => James
        Node 3 => Thomas
        Node 4 => June
        Node 5 => Amy

Enter Action Code (? for help): m

   [4] is head_node, [2] is tail_node

   Queue array nodes are as follows:
        [1] => June
        [2] => Amy
        [3] =>
        [4] => John
        [5] => James
        [6] => Thomas

Enter Action Code (? for help): e