data structure

Assume class Simplelinked List 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; 3 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 && Ifound) { if (current.info searchinfo) { found = true; } else { current = current link: } } 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) { 13