4) Write a new method called sortedInsert (node item). This method takes in a node and adds it to an already sorted list in sorted order. You may assume that the list is sorted before calling the method. You might use the diagram to help picture what needs to happen. You may also assume that the node class implements the comparable interface allowing simple relational operators to function. [3 points] Head Tail 6264656700