Do according to question Dont use built in functionsDont use anything globally Create your own stack and queue if neededDont use built in stack and queue.Do in c++ language Question 2:Task is to update the previously implemented Single linked list by followingfunctions using the following Node definition for all problems:class NodeItem data;Node *next;Note: The head pointer of LinkedList class is publicly accessible1. Write a function to concatenate two linked lists. Given lists 11 = (2, 3, 1) and 12= (4, 5), after return from concatenate(11,12) the list 11 should be changed to be11 = (2, 3, 1, 4, 5). Your function should not change 12 and should not directlylink nodes from 1l to 12 (i.e. the nodes inserted into 11 should be copiesof the nodes from 12.)void concatenate(Node & hl, Node* h2 )://// Precondition: hl and h2 are head pointers of linked lists.I/ The lists may be empty or non-empty.//// Postcondition: A copy of list h2 is concatenated (added to the end) of list hl. Listh2 should be unchanged by the function.// NOTE: The nodes added to the list hl must be copies of theI/ nodes in list h2.2. Write a function to insert a number into a sorted linked list. Assume the listis sorted from smallest to largest value. After insertion, the list should still besorted. Given the list 11 = (3, 17, 18, 27) and the value 20, on return 11 be thelist (3, 17, 18, 20, 27).void insertInOrder(Node*& head_ptr, intvalue); //// Precondition: head_ptr is the head pointer of a linked listI/ sorted in non-decreasing order. The list may be empty or non-empty.// Postcondition: The number value is inserted in the list.// The list should be sorted on return from the function.3. Write a function to return the median value in a sorted linked list. If thelength i of the list is odd, then the median is the ceiling(i/2) member. Forexample, given the list (1, 2, 2, 5, 7, 9, 11) as input, your function shouldreturn the value 5. If the length of the list is even, then the median is themean of the i/2 and (i/2)+1 members. Thus, the median of the sorted list (2,4, 8, 9) is (4+8)/2. Finally, define the median of an empty list to be 0.4. Write a function to reverse the nodes in a linked list. Your function shouldhave time complexity O(n), where n is the length of the list. You shouldcreate no new nodes,void reverse(Node"& head_ptr);// Precondition: head_ptr is the head pointer of a linked list.// The list may be empty or non-empty.I/ Postcondition: head_ptr points to the list of Nodes in reverseI/ order.

Question

Do according to question Dont use built in functionsDont use anything globally Create your own stack and queue if neededDont use built in stack and queue.Do in c++ language Question 2:Task is to update the previously implemented Single linked list by followingfunctions using the following Node definition for all problems:class NodeItem data;Node *next;Note: The head pointer of LinkedList class is publicly accessible1. Write a function to concatenate two linked lists. Given lists 11 = (2, 3, 1) and 12= (4, 5), after return from concatenate(11,12) the list 11 should be changed to be11 = (2, 3, 1, 4, 5). Your function should not change 12 and should not directlylink nodes from 1l to 12 (i.e. the nodes inserted into 11 should be copiesof the nodes from 12.)void concatenate(Node & hl, Node* h2 )://// Precondition: hl and h2 are head pointers of linked lists.I/ The lists may be empty or non-empty.//// Postcondition: A copy of list h2 is concatenated (added to the end) of list hl. Listh2 should be unchanged by the function.// NOTE: The nodes added to the list hl must be copies of theI/ nodes in list h2.2. Write a function to insert a number into a sorted linked list. Assume the listis sorted from smallest to largest value. After insertion, the list should still besorted. Given the list 11 = (3, 17, 18, 27) and the value 20, on return 11 be thelist (3, 17, 18, 20, 27).void insertInOrder(Node*& head_ptr, intvalue); //// Precondition: head_ptr is the head pointer of a linked listI/ sorted in non-decreasing order. The list may be empty or non-empty.// Postcondition: The number value is inserted in the list.// The list should be sorted on return from the function.3. Write a function to return the median value in a sorted linked list. If thelength i of the list is odd, then the median is the ceiling(i/2) member. Forexample, given the list (1, 2, 2, 5, 7, 9, 11) as input, your function shouldreturn the value 5. If the length of the list is even, then the median is themean of the i/2 and (i/2)+1 members. Thus, the median of the sorted list (2,4, 8, 9) is (4+8)/2. Finally, define the median of an empty list to be 0.4. Write a function to reverse the nodes in a linked list. Your function shouldhave time complexity O(n), where n is the length of the list. You shouldcreate no new nodes,void reverse(Node&#34;& head_ptr);// Precondition: head_ptr is the head pointer of a linked list.// The list may be empty or non-empty.I/ Postcondition: head_ptr points to the list of Nodes in reverseI/ order.

Accepted Answer

#include <iostream>using namespace std;class Node{public: int data; Node * next;};// to create…