Implement the T dequeue() method for the CircularLinkedQueue class. The method removes and returns the front element from the queue.

Solve the problem in two parts

Part I Write the algorithm with general case and special case(s). Also, draw the abstract view of the circular linked queue to strengthen the algorithm.

Part II Write the complete java method implementation. You could also test the method using a driver program. The beginning part of CircularLinkedQueue class is given to you here -

public class CircularLinkedQueue implements QueueInterface{

protected LLNode rear; // reference to the rear of this queue

protected int numElements = 0; // number of elements in this queue //Constructor

public CircularLinkedQueue(){ rear = null; } //Methods

public T dequeue(){ //method to be implemented here } }