In C++, use provided code

Implement a singly Linked List for Integers

Implement functions for:

~Printing the list

~Adding

~Add to end of the list

~Searching

~Deleting

Delete any node in the list

Assumption: no duplicate integers

At the minimum, try to implement print, add, and search

Code:

#include using namespace std;

class IntNode { public: IntNode() {} IntNode(int d, IntNode* n) { data = d; next = n; } int getData() { return data; } IntNode* getNext() { return next; } void setData(int d) { data = d; } void setNext(IntNode* n) { next = n; }

private: int data; IntNode *next; };

bool search(IntNode* head, int target); void add(IntNode* &head, int value); void deleteNode(IntNode* &head, int value); void print(IntNode* head);

int main() { IntNode* head = NULL; char choice; int value; while(true){ cout>choice; choice = tolower(choice); switch(choice){ case 'a': cout>value; add(head,value); break; case 'd': cout>value; deleteNode(head,value); break; case 's': cout>value; cout include kiostream using namespace std; 4 class IntNode f public: IntNode Int Node (int d, Int Node* n) data d; ext. 10 int getData 12 E 13 return data; 15 IntNode getNext 16 return next; 17 18 void setData (int d) 19 20 data d 21 22 E void set Next (IntNode* n) 23 ext. 24 25 private: 27 int data; 28 IntNode *n. ext. 29 30 31 bool search (IntNode* ead int target) 32 void add (IntNo de* head, int value) 33 void deleteNode (IntNode* head, int value) 34 void print (IntNode* ead)