public final class LinkedBag1 implementsBagInterface {    private class Node {        private T data; // Entry inbag        private Node next; // Link tonext node        public Object item;        private Node(T dataPortion){           this(dataPortion, null);        } // end constructor        private Node(T dataPortion, NodenextNode) {            data =dataPortion;            next =nextNode;        } // end constructor    } // end Node    private Node firstNode; // Reference to firstnode    private int numberOfEntries;    public LinkedBag1() {        firstNode = null;        numberOfEntries = 0;    } // end default constructor    /**    * Adds a new entry to this bag.    *    * @param newEntry The object to be added as a newentry.    * @return True.    */    public boolean add(T newEntry) // OutOfMemoryErrorpossible    {        // Add to beginning ofchain:        Node newNode = newNode(newEntry);        newNode.next = firstNode; //Make new node reference rest of chain        // (firstNode is null if chainis empty)        firstNode = newNode; // New nodeis at beginning of chain        numberOfEntries++;        return true;    } // end add    /**    * Retrieves all entries that are in this bag.    *    * @return A newly allocated array of all theentries in this bag.    */    public T[] toArray() {        // The cast is safe because thenew array contains null entries.       @SuppressWarnings(“unchecked”)        T[] result = (T[]) newObject[numberOfEntries]; // Unchecked cast        int index = 0;        Node currentNode =firstNode;        while ((index .Node newNode = null;            currNode.next= newNode;        }        return false;    }    public boolean removeAll(T anEntry) {               return false;       }    public boolean myequals(LinkedBag1 other){               return false;    }    public LinkedBag1intersection(LinkedBag1 other) {        LinkedBag1 result = newLinkedBag1();        //result.add(newEntry);        return result;    } . . .