C++

1) Write a function, to be included in a sorted linked list class, called betweenltems, that will receive two T arameters called start and end. The function will return how many items in the list are between start and end both included) For example, if the list is 6 79 14 21 45 and start is 8 and end is 21, the function will return 3. Consider (and test your function) on all cases (ex: in the list above if start is 78 and end is 95, or if start is and end is 5, or if start is 5 and end is 50, or if start is 2 and end is 15, or if start is 14 and end is 60). Also if parameters are negative or start is greater than or equal to end, then obviously there cannot be anything between them. Consider efficieney (list is sorted)