Provide a detailed explanation line by line. Explain how this C++ program functions Source Codes #include using namespace std; // Node struct to hold data and pointer to next node struct Node { int data; Node* next; }; // Linked List class class LinkedList { private: Node* head; // pointer to head node public: LinkedList() { head = NULL; // initialize head to NULL } // Insert a new node at the front of the list void insert(int value) { Node* newNode = new Node(); // create a new node newNode->data = value; // set the data of the new node to the input value newNode->next = head; // set the next pointer of the new node to the current head node head = newNode; // set the head pointer to the new node } // Delete a node with a specific value from the list void deleteNode(int value) { Node* current = head; // set a pointer to the current node Node* previous = NULL; // set a pointer to the previous node // Iterate through the list to find the node with the specific value while (current != NULL) { if (current->data == value) { // If the current node is the head, update the head pointer if (previous == NULL) { head = current->next; } // Otherwise, update the previous node's next pointer else { previous->next = current->next; } delete current; // delete the current node return; } // Update the previous and current pointers previous = current; current = current->next; } cout << "Element successfully removed.\n"; } // Print the full list void getFullList() { Node* current = head; // set a pointer to the current node cout << "Full List: "; // Iterate through the list and print each node's data while (current != NULL) { cout << current->data << " "; current = current->next; } cout << endl; } // Check if the list is empty bool isEmpty() { if (head == NULL) { return true; } return false; } //to modify an existing element void modify(int ele,int ele2) { Node* current = head; // set a pointer to the current node bool f=false; // Iterate through the list and print each node's data while (current != NULL) { if(current->data==ele){ current->data=ele2; f=true; } current = current->next; } if(f) cout<>ch; switch(ch){ case 1 : cout<>ele;list.insert(ele); cout << "Element successfully added.\n";break; case 2 : cout<>ele;list.deleteNode(ele);break; case 3: cout<>ele; cout<>ele2; list.modify(ele,ele2);break; case 4: // Print the updated list list.getFullList(); break; case 5: // Check if the list is empty if (list.isEmpty()) { cout << "The list is empty." << endl; } else { cout << "The list is not empty." << endl; } // Output: The list is not empty. break; case 6: exit(0); default : cout<