(In C++ please) Assume that a singly linkedlist is implemented with a header node, but no tail node, and thatit maintains only a pointer to the header node. Write a class thatincludes methods to:
a. return the size of the linked list
b. print the linked list
c. test if a value x is contained in the linked list
d. add a value x if it is not already contained in the linkedlist
e. remove a value x if it is contained in the linked list
How would Imaintain the singly linkedlist in sorted order?
what I have so far:
#include <iostream>
using namespace std;
//struct for node of list
struct
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured