1. Please answer question only where it states "add code above this line " and add cofe below this
line"
C++ please
Implement a class that represents a linked list of integers. The class should have the following
methods: - void insert(int value): Inserts a new node with the given at the end of the list. - bool
contains(int value): Returns if the list contains a node with the given value, and otherwise. - int
size(): Returns the in the list. For example, the following code should be valid: 1 #include using
namespace std; struct Node { int data; Node* next; Node(int value) { this-rdata = value; this-
rnext = NULL; } class UnorderedList { public: Node* head; I/ Constructor UnorderedList() {
head = NULL; II Function to insert a node at the end of the linked list. void insert(int value) {
lladd code below this tine lladd code above this line 3 1. Function to calcluate the size of linked
list. int size() i lladd code below this line 7/. Function to calcluate the size of Finked list. int
size() { lladd code below this line lladd code above this line } I/ Function to check if the list
contains a node with the given value or not bool contains(int value) { Iladd code below this line
lladd code above this line 3 } II Function to print the values of linked list. void printlist (Node*
head) { Node* p = head; while (p : = nullptr) { std: : cout p > data std: : endl; p = p > next; 3 3
int main(int arge, char* argv [ ] ) i int size = stoi ( argv [ 1 ]) ; int element 1 = stoi ( argv [ 2 ]) ;
int element 2 = stoi ( argv [ 3 ]) ; int element3 = stoi ( argv [ 4 ]) ; Unorderedlist list; lladd code
above this line f; 1. Function to print the values of linked list. void printlist (Node* head) {
Node: p = head; while ( p := nullptr) { std: : cout p data std: :endl; p = p > n e x t ; } } int
main(int argc, char* argv[]) { int size = stoi ( argv [ 1 ]) ; int element1 = stoi ( argv [ 2 ]) ; int
element2 = stoi ( argv [ 3 ]) ; int element 3 = stoi ( argv [ 4 ]) ; Unorderedlist list;
list.insert(element 1 ); list. insert (element2); List. insert (element3); printlist (list. head); cout <
list, contains (element 1 ) < < list. contains ( 100 ) << e n d l ; cout < list. contains (element 3 ) <
; return ;