Problem 1

Create a Queue data structure.

Methods:

• Enqueue

Add an element to the back of the Queue.

• Dequeue

Remove an element at the front of the Queue.

• Peek

Get the element at the front of the Queue without removing it from the Queue.

• Size

Get the size of the Queue.

• IsEmpty

Check if the Queue is empty.

! Please check the tests for signature and more examples.