Help make the follwing function for a array /queue of strings--------> void::queue::goToBack()   //PURPOSE of the function:      // if empty, throws an exception Underflow 1. if queue has just 1 element, does nothing 2. if queue has more than 1 element, moves the front one to the rear by calling remove followed by add.     So far I have:     void queue::goToBack() {   // I  need help making a local variable   // here I'm supposed to  call remove and add }

Given an IntNode struct and the operating functions for a linked list, complete the following functions to extend the functionality of the linked list(this is not graded).

Having trouble with creating the InsertAtEnd function in the ItemNode.h file below.  "    // TODO: Define InsertAtEnd() function that inserts a node    //       to the end of the linked list" Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts  ------------------------------------------------------- main.cpp -------------------------------------------------------- #include "ItemNode.h" int main() {    ItemNode *headNode;  // Create intNode objects                                                       ItemNode *currNode;    ItemNode *lastNode;     string item;    int i;    int input;     // Front of nodes list                                                                             headNode = new ItemNode();    lastNode = headNode;     cin >> input;     for (i = 0; i < input; i++) {        cin >> item;…