In an Implementation of a Stack Based on a Singly-Linked

Multiple Choice

In an implementation of a stack based on a singly-linked list,it is most efficient to add a new item so that

A) the new item has the highest index of all items in the list
B) the new item has the lowest index of all items in the list
C) the new item is not duplicated by any other item already in the stack
D) the items in the stack stay sorted in ascending order