Please I need help with this... in C++
***********************************************************************************************
Write an OOP program to store integers into a linked list.
Add code so that the linked list sorted
Add a function so you can search for an integer
Have a function to ask the user for input.
Add a function to delete and integer
Have the ability to know/printout the count of the number of integers
Have a function to print out the array
/* * C++ Program to Implement Singly Linked List */ #include
#include #include using namespace std; /* * Node Declaration */ struct node { int info; struct node *next; }*start; /* * Class Declaration */ class single_llist { public: node* create_node(int); void insert_begin() void delete_pos(); void search(); void display(); single_llist() { start = NULL; } }; /* * Main :contains menu */ main() { int choice, nodes, element, position, i; single_llist sl; start = NULL; while (1) { cout<>choice; switch(choice) { case 1: cout<<\"Inserting Node at Beginning: \"<info = value; temp->next = NULL; return temp; } } /* * Inserting element in beginning */ void single_llist::insert_begin() { int value; cout<<\"Enter the value to be inserted: \"; cin>>value; struct node *temp, *p; temp = create_node(value); if (start == NULL) { start = temp; start->next = NULL; } else { p = start; start = temp; start->next = p; } cout<<\"Element Inserted at beginning\"<>pos; struct node *s, *ptr; s = start; if (pos == 1) { start = s->next; } else { while (s != NULL) { s = s->next; counter++; } if (pos > 0 && pos <= counter) { s = start; for (i = 1;i < pos;i++) { ptr = s; s = s->next; } ptr->next = s->next; } else { cout<<\"Position out of range\"<>value; struct node *s; s = start; while (s != NULL) { pos++; if (s->info == value) { flag = true; cout<<\"Element \"<next; } if (!flag) cout<<\"Element \"<info<<\"->\"; temp = temp->next; } cout<<\"NULL\"<