True/False (13) 1. Adding a node to an empty chain is the same as adding a node to the beginning of a chain. 2. Adding a node at the end of a chain of n nodes is the same as adding a node at position n. 3. You need a temporary variable to reference nodes as you traverse a list. 4. The efficiency of the displayList method is directly related to the efficiency of the getEntry method. 5. You cannot use an assert statement to determine of a list is empty. 6. A fundamental operation of a list is a traversal. 7. You must know how much memory to allocate before creating a linked implementation of a list. 8. A linked implementation of a list grows and shrinks dynamically as nodes are added and deleted. 9. In a linked implementation of a list, you only call the method getNodeAt when we remove an entry other than the first one. 10. Replacing a node in a linked implementation of a list only requires locating the node and replacing the data portion of the node. 11. In a linked implementation of a list, the replace method replaces the entire node. 12. Retrieving a list entry using a linked implementation is faster than using an array representation. 13. Replacing a list entry using an array implementation is faster than using a linked representation