Please submit two files as follows. No ZIP files accepted.

$1$ source code file containing all of your code with filename LAST$\_$NAME$\_$CUNYID.cpp

$1$ output file containing the results of the two tests cases with filename LAST$\_$NAME$\_$CUNYID.txt

The output file will have the following content:

After each and every invocation of enqueue$()$ and each and every invocation of dequeue$(),$ output a line in the format given in lecture the following: enqueue$($element enqueued$)$ or dequeue, succeed or fail, queue size, front element, back element.

Test Case $1$ queue operations:

enqueue$(1),$ enqueue$(2),...,$ enqueue$(4)$

$2$ times dequeue$()$

enqueue$(5),$ enqueue$(6),...$ enqueue$(11)$

$4$ times dequeue$()$

enqueue$(20),$ enqueue$(21)...,$ enqueue$(31)$

$5$ times dequeue$()$

enqueue$(35),$ enqueue$(36),...,$ enqueue$(49)$

$20$ times dequeue$()$

Test Case $2$ queue operations

enqueue$(1),$ enqueue$(2),...$ enqueue$(10)$

$11$ times dequeue$()$

enqueue$(15),$ enqueue$(16),...$ enqueue$(48)$

$5$ times dequeue$()$