C++ Singly Linked List. Please can you assist with this?

For this assignment, you will implement a singly-linked node class. Use your singly-linked node to implement a singly-linked list class that maintains its elements in ascending order. The SinglyLinkedList class is defined by the following data: . A node pointer to the front and the tail of the list Implement the following methods in your class: . A default constructor A copy constructor Access to first element Access to last element Insert value Remove value at front Remove value at tail Determine if empty Return # of elements Reverse order of elements in list . Merge with another ordered list list myList list myList(aList) myList.front() myList.back() myList.insert(val) myList.pop_front() myList.pop_back() myList.empty() myList.size() myList.reverse() myList.mergealist) Write a thorough test program for this class