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

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)