4 pts D Question 4 (TCO 1) When adding an entry to an array-based implementation of the ADT list, at the end of the list O all of the previous elements must be shifted toward the front of the array O only one element is shifted toward the end of the array to make room O only one element is shifted toward the beginning of the array to make room O no shift is necessary D Question 5 4 pts (TCO 2) In the node object of a linked list, the next field contains O the data portion of the node O a pointer to the beginning of the list O a pointer to another node O an int value