IN C++ please (Call your class as List. Make sure your code uses templates and template parameters. Write a driver (main) to test each member function of the List class at least once.)

Assume that a singly linked list is implemented with a header node, but no tail node, and that it maintains only a pointer to the header node.

Write a class that includes 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 linked list

e. remove a value x if it is contained in the linked list