please help ? 12-34-1324Language/Type:C++ linked lists pointersWrite the code that will produce the given "after" result from the given "before" starting point by modifyinglinks between the nodes shown and/or creating new nodes as needed. Assume that the nodes have alreadybeen declared and initialized to match the "before" figure below. There may be more than one way to writethe 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.Before list: 1 - 2 /temp: 3 > 4 /list: 1 -> 3 -> 2 -> 4 /AfterAssume 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 program23 struct ListNode {4int data;ListNode* next;ListNode (int data=Ø, ListNode* next=nullptr) : data(data), next (next) {}67 };89 int main() {!! a function-definition is not allowed here before '{' tokenint num1, num2;10111213141516171819202122232425262728293031323334std::cout << "Enter the first number for the first linked list: ";std::cin>> num1;std::cout << "Enter the second number for the first linked list: ";std::cin>> num2;ListNode* list = new ListNode (num1, new ListNode (num2, nullptr));int num3, num4;std::cout << "Enter the first number for the second linked list: ";std::cin>> num3;std::cout << "Enter the second number for the second linked list: ";std::cin>> num4;ListNode* temp = new ListNode (num3, new ListNode (num4, nullptr));temp->next = list->next;list->next = temp;ListNode* curr = list;while (curr != nullptr) {}std::cout << curr->data <<curr = curr->next;std::cout << "nullptr\n";353637 }38394041424344Bare code. Write a fragment of C++ code as described, without any main function or heading around your code.return 0;XX

In this question we have to write a C++ program for the node linking of the list node from the temp…

? 12-34-1324 ♡ 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: 12/ temp: 3-> 4/ list: 1>3> 2 -> 4/ After 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 = 0, ListNode* next = nullptr) {...} }; // constructor 2 3 struct ListNode ( 4 int data; ListNode* next; ListNode(int data=0, ListNode* next=nullptr): data(data), next (next) () 5 6 7 }; 8 9 int main() { a function-definition is not allowed here before '{' token int num1, num2; 10 11 12 13 14 15 16 17 18 19 20 21 #include problem context error: expected bare code, but found program 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 } std::cout << "Enter the first number for the first linked list: "; std::cin>> num1; std::cout << "Enter the second number for the first linked list: "; std::cin>> num2; ListNode* list = new ListNode (num1, new ListNode (num2, nullptr)); int num3, num4; std::cout << "Enter the first number for the second linked list: "; std::cin>> num3; std::cout << "Enter the second number for the second linked list: "; std::cin>> num4; ListNode* temp = new ListNode (num3, new ListNode (num4, nullptr)); temp->next = list->next; list->next = temp; ListNode* curr list; while (curr != nullptr) { std::cout << curr->data << "->"; curr = curr->next; } std::cout << "nullptr\n"; return 0; X X