In this question, we ask to implement a singly linked list sorted in increasing order, where the data type of each element $($node$)$ is String. implement the following methods:

a$)(2$ pts$)$ Insert a new element at a correct place that keeps the list sorted.

b$)(2$ pts$)$ Delete an element, if it exists, from the list.

c$)(1$ pt$)$ Count the number of occurrences of a specific string in your list.

d$)(2$ pt$)$ Copy the data elements of your list $($the strings in this example$)$ into an array of strings. After copying, you need to display the array$$s elements to compare with the original list.