Using an appropriate definition of ListNode, design a simple linked list class with only two member functions and a default constructor:

void add$($double x$)$;

boolean isMember$($double x$)$;

LinkedList$()$;

The add function adds a new node containing x to the front $($head$)$ of the list, while the isMember function tests to see if the list contains a node with the value x$.$ Test your linked list class by adding various numbers to the list and then testing for membership.

List Copy Constructor Modify your list class of Previous Programming to add a copy constructor. Test your class by making a copy of a list and then testing membership on the copy.

List Print Modify the list class you created in the previous programming challenges to add a print member function. Test the class by starting with an empty list, adding some elements, and then printing the resulting list out.

Recursive Member Check Modify the list class you created in the previous programming challenges to use a recursive method to check for list membership. Test your class.

List Member Deletion Modify the list class you created in the previous programming challenges by adding a function to remove an item from the list and by adding a destructor:

void remove$($double x$)$;

~LinkedList$()$;

Test the class by adding a sequence of instructions that mixes operations for adding items, removing items, and printing the list.

List Reverse Modify the list class you created in the previous programming challenges by adding a member function for reversing the list:

void reverse$()$;

The member function rearranges the nodes in the list so that their order is reversed. You should do this without creating or destroying nodes.