Assume class SimpleLinkedList is defined as follows: public class SimpleLinkedList { protected Node first; protected Node last; protected int count; public SimpleLinkedList() { first = null; last = null; count = 0; } public boolean isEmpty() { return first == null; } public int length() { return count; } public void print() { Node current = first; while (current != null) { System.out.print(current.info + " "); current = current.link; } } public boolean search(int searchInfo) { Node current = first; boolean found = false; while (current != null && !found) { if (current.info == searchInfo) { found = true; } else { current = current.link; } } return found; } public void insert(int newInfo) { Node newNode = new Node(newInfo); if (isEmpty()) { first = last = newNode; } else { newNode.link = first; first = newNode; } count++; } } Add a method to SimpleLinkedList that adds the node containing a new element before the last node in a linked list: public void addBeforeLast(int newInfo) { ..... }