Return the first element of a queue (FIFO) without removing it.

Initialize a circular queue of size n with sequential values.

Add an element to the back of a queue (enqueue operation).