All functions 1-4 belong to a template class: template the functions will be graded for efficiency (when applicable) as well as correctness. use the same identifiers we used in class: node, info, next, prev, first. first points to the first node and it is the only pointer in any type of list. . 1) Write a function, to be included in a sorted linked list class, called betweenltems, that will receive two T parameters 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 7,9 14 21 45 and start is 8 and end is 21, the function will return 3 onsider (and test your function) on all cases (ex: in the list above if start is 78 and end is 95, or if start i 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). Als are negative or start is greater than or equal to end, then obviously there cannot be anything between them. Consider efficiency (list is sorted)