Write a function that removes the maximum valued element from a singly linked list. The list may empty. You can assume that all items are unique. For example, suppose the list is: 11, 12, 3, 4. Then after removing the maximum valued element, the list should be 11, 3, 4. Note that the length of the list is not stored. Your function should run in time linear to the size of the list and use constant extra space. You may use two loops. public class List { private Node first; private static class Nodet public double item; public Node next; 1 single link, not double link! > public void deleteMax () {