26. In a pointer-based implementation of an linked list. a. increasing the size of the list can waste storage and time b. less memory is required to store an item than in an array-based implementation...

Extracted text: 26. In a pointer-based implementation of an linked list. a. increasing the size of the list can waste storage and time b. less memory is required to store an item than in an array-based implementation c. an item explicitly points to the next item d. items can be accessed directly with equal access time