Queue

Develop a class to represent a Queue $($Single ended$)$ You may use either a dynamic array OR a

linked list as an underlying implementation.

Required Public Methods:

Queue$()$

Default Constructor. Should set up any underlying data structures used to implement the queue.

Enqueue$($Qtype item$)$

Inserts the item at the end of the queue.

Qtype Dequeue$()$

Removes and returns the item at the front of the queue. This should fail if the queue is empty

Qtype Peek$()$

Returns the value of the item in the front of the queue. Note that this should NOT remove the

item.

int Size$()$

Returns the number of elements in the queue