6. To locate a node within a chain that is near the end of the lis e must a. start at the last node and traverse the chai b. start at the first node and traverse the chain c. directly access the node. d. none of the above. 7. in the linked implemention of a list, th publc void add( T newEntry) insert a new entry a. at the beginning of the lis b. at the end of the list. c. between adjacent nodes of the list. d. all of the abov in a linked implementation of a list with a tail reference, removing are make tail null reference a. the list is empty b. the listis full c. the list only contains one entry d. the above. 9 In a inked-based implementation of the ADT list with only a head reference erformance of adding an entry at the end of the list? . O(n) b. ?(n) C. O(log n)