Java questions

A list is an _ object ___ whose data consists of ordered entries. Each entry is identified by its ___ position ___ within the list. The entries in a bag are _ unordered__, whereas the entries in a list, a stack, a queue, a deque, or a priority queue do have an ____ order __. A list, unlike a stack, a queue, a deque, or a priority queue, enables us to add, retrieve, remove, or replace an entry at _ any ____ given position. The ADT list can be implemented by using an_array_ or a _linked list __ to store items in a list. Adding an entry to or removing an entry from an array-based list typically requires that other entries __ shift ___ by one position within the array. This data movement degrades the time efficiency of these operations, particularly when the list is long and the position of the addition or removal is near the beginning of the list. Expanding the size of an array adds to the time required by the affected add method, since doing so requires ___ copying ____ the contents of the array to a larger array. Maintaining a reference to a chain's last node as well as to Its first node eliminates the need for a __ traversal _ when adding a node at the _ end __ of the chain. A client manipulates or accesses a list's entries by using only the operations defined for the ADT list. ListInterface runnerList = new AList (): ListInterface myList = new LList (): The client is of type ListInterface which has access to only the ADT list operations. Why does the time efficiency degrade when the list is long and the position of the addition or Removal is near the beginning of the list? Adding an entry near the beginning of the array requires making room for the new entry by shifting all other entries towards the end of the list. Removing an entry near the beginning of the array requires closing the gap left from removing that entry by shifting the entries one by one towards the beginning of the list. Why adding to the end of a list is faster when the chain has both head and tail references than when it has only a head reference? Eliminates the need for traversing (looping through) the whole chain to add a node at the end