A queue is a First$-$In$-$First$-$Out $($FIFO$)$ data structure that supports the following operations: Enqueue, Dequeue, Peek, and IsEmpty. Which of the following statements is TRUE about the Peek operation in a queue?

The Peek operation adds a new element to the rear of the queue.

The Peek operation removes the front element from the queue.

The Peek operation checks if the queue is empty, but does not return any element.

The Peek operation returns the front element of the queue without removing it$.$