Finish the UML class diagram of the class linkedQueueType.

template struct nodeType { Type info; nodeType *link; };

template class linkedQueueType: public queueADT { public: const linkedQueueType& operator= (const linkedQueueType&); //Overload the assignment operator.

bool isEmptyQueue() const; //Function to determine whether the queue is empty. //Postcondition: Returns true if the queue is empty, // otherwise returns false.

bool isFullQueue() const; //Function to determine whether the queue is full. //Postcondition: Returns true if the queue is full, // otherwise returns false.

void initializeQueue(); //Function to initialize the queue to an empty state. //Postcondition: queueFront = nullptr; queueRear = nullptr

Type front() const; //Function to return the first element of the queue. //Precondition: The queue exists and is not empty. //Postcondition: If the queue is empty, the program // terminates; otherwise, the first // element of the queue is returned.

Type back() const; //Function to return the last element of the queue. //Precondition: The queue exists and is not empty. //Postcondition: If the queue is empty, the program // terminates; otherwise, the last // element of the queue is returned.

void addQueue(const Type& queueElement); //Function to add queueElement to the queue. //Precondition: The queue exists and is not full. //Postcondition: The queue is changed and queueElement // is added to the queue.

void deleteQueue(); //Function to remove the first element of the queue. //Precondition: The queue exists and is not empty. //Postcondition: The queue is changed and the first // element is removed from the queue.

linkedQueueType(); //Default constructor

linkedQueueType(const linkedQueueType& otherQueue); //Copy constructor

~linkedQueueType(); //Destructor private:

nodeType *queueFront; //pointer to the front of the queue

nodeType *queueRear; //pointer to the rear of //the queue };