The document provides instructions for an assignment to create a generic ordered SortedLinkedList class in C# based on a generic LinkedList class. The SortedLinkedList class must support an Add method that inserts elements in dictionary order and handle 4 cases when adding an element: an empty list, element smaller than first, larger than last, or between first and last elements. The assignment requires demonstrating the functional class by creating an integer list, adding test data, and iterating over the list.

1. I have the LinkedList project and the input file path and output file path. I need this class created. I
am using C#
In this assignment, you will implement a generic ordered SortedLinkedList class based upon the
generic LinkedList class of your design. The use of a framework or third-party packages is
prohibited. You can either utilize inheritance or composition in your implementation. The class
must support a single Add method that accepts a single generic parameter as shown in the
signature below. This parameter will be inserted into the list in its proper sequence (dictionary
order, case-insensitive). public void Add(T element) There are four conditions that must be
handled in your insert method: 1. The list is empty 2. The new element is smaller than the first
element 3. The new element is larger than the last element 4. The new element is larger than the
first element and smaller than the last element Demonstrate that your class is functional by
creating an ordered list of integers, adding the test data (given below), and iterating over the list to
display the contents of the list (in node order). Integer data: 7,6,10,15,4,0,10,5,3,11,6,3,0,1, and 8
.