CIRCULAR SORTED LINKED LIST CLASS

Design and implement a class representing a circular sorted linked list. The class, called CList, must have the following requirements:

1. The linked list and the nodes must be implemented as C++ templates
2. The class has only one private data member: a pointer to the last node.
3. It must include a constructor, a destructor, a copy constructor and an operator=
4. It must include functions to destroy a list, copy a list, insert a given item in the list, delete a given item from the list, search for a given item in the list, check if the list is empty, return the length of the list and print the list in ascending order.