X731: Linked Chain Find Middle Node

Consider the following class definitions: 2 1 public class LinkedChain { private Node firstNode; private int numberOfEntries; 3 + 6 9 10 11 12 13 14 15 16 17 18 19 20 21 22} public LinkedChain() { null; firstNode numberOfEntries 0; }// end default constructor } = public int getNumberOfEntries() { return numberOfEntries; = } public void push(T newEntry) { // TODO Auto-generated method stub firstNode = new Node (newEntry, firstNode); numberOfEntries++;