Implement a enqueue(), dequeue(), and peek() member function for a queue class that uses a CircularlyLinkedList as its underlying representation. The only data member of queue is CircularlyLinkedList cll, which has the following member functions:

• node_t* CircularlyLinkedList::getHead()
• node_t* CircularlyLinkedList::getTail()
• void CircularlyLinkedList::insert(node_t* before, int value)
• void CircularlyLinkedList::remove(node_t* victim)

node_t is a struct with elements int value and node_t* next.