please fix this error You are working on problem set: Lab 4 copy. Pause) i12-34-1342Language/Type:C++ linked lists pointersWrite the code that will produce the given "after" result from the given "before" starting point bymodifying links between the nodes shown and/or creating new nodes as needed. Assume that the nodeshave already been declared and initialized to match the "before" figure below. There may be more thanone way to write the code, but do NOT change any existing node's data field value.If a variable does not appear in the "after" picture, it doesn't matter what value it has after the changes aremade. If a given node object does not appear in the "After" picture, you must free its memory to avoid amemory leak.Beforelist: 1 -> 2/temp: 3 -> 4 /After list: 1 -> 3 -> 4 -> 2/Assume that you are using the following ListNode structure:struct ListNode {int data;// data stored in this nodeListNode* next; // a link to the next node in the list};ListNode(int data Ø, ListNode* next = nullptr) { ... }=// constructor1 #include problem context error: expected bare code, but found program2 using namespace std;3 struct ListNode {4int data;5ListNode* next;ListNode (int data = Ø, ListNode* next =8910 };11 int main() {!!a function-definition is not allowed here before '{' token1213141516171819202122232425262728293031323334353637383940411 42 43this->data = data;this->next = next;}ListNode* list = new ListNode(1, new ListNode (2)); // initial linked listListNode* temp = new ListNode (3, new ListNode (4)); // temporary linked list// Find the last node in the "list" linked listListNode* current = list;while (current->next != nullptr) {current = current->next;}// Add the first node of the "temp" linked list to the end of the "list" linked listcurrent->next = temp;// Find the last node in the "temp" linked listwhile (temp->next != nullptr) {temp = temp->next;}// Add the second node of the "list" linked list after the last node in the "temp" linkedtemp->next = list->next;// Remove the first node in the "list" linked listListNode* toDelete = list;list = list->next;delete toDelete;// Print the resulting linked listcurrent = list;while (current != nullptr) {cout << current->data << "->";current = current->next;nullptr) {}cout << "null" << endl;// Free memorycurrent = list;while (current != nullptr) {toDelete = current;current = current->next;delete toDelete;

You are working on problem set: Lab 4 copy (Pause) i 12-34-1342 ♡ Language/Type: C++ linked lists pointers Write the code that will produce the given "after" result from the given "before" starting point by modifying links between the nodes shown and/or creating new nodes as needed. Assume that the nodes have already been declared and initialized to match the "before" figure below. There may be more than one way to write the code, but do NOT change any existing node's data field value. If a variable does not appear in the "after" picture, it doesn't matter what value it has after the changes are made. If a given node object does not appear in the "After" picture, you must free its memory to avoid a memory leak. Before list: 1 -> 2/ temp: 3-> 4/ After list: 1 -> 3 -> 4 -> 2/ Assume that you are using the following ListNode structure: struct ListNode ( int data; // data stored in this node ListNode* next; // a link to the next node in the list }; ListNode(int data = 8, ListNode next = nullptr) {...} // constructor 2 using namespace std; 3 struct ListNode ( 4 int data; 5 6 7 8 9 田LBH56789812BU5SZS四班1234355初83981 ListNode next; ListNode(int data = 8, ListNode* next = nullptr) { this->data data; this->next next; 18 ); 11 int main() { function-definition is not allowed here before '{"token ListNode list = new ListNode(1, new ListNode (2)); // initial linked list ListNode* temp = new ListNode (3, new ListNode (4)); // temporary linked list // Find the last node in the "list" linked list ListNode* current = list; while (current->next != nullptr) { current current->next; a } } // Add the first node of the "temp" linked list to the end of the "list" linked current->next = temp; // Find the last node in the "temp" linked list while (temp->next != nullptr) { temp temp->next; } // Add the second node of the "list" linked list after the last node in the "temp temp->next = list->next; // Remove the first node in the "list" linked list ListNode toDelete = list; list list->next; delete toDelete; // Print the resulting linked list current = list; while (current != nullptr) { } cout << current->data << "->"; current current->next; cout << "null" << endl; // Free memory current list; while (current != nullptr) { toDelete current;