A priority queue of size n is implemented as an unsorted linked list. The linked list maintains a tail pointer, so adding an element to the end of the list takes O( 1 ) time. Removing an element takes O ( n ) time. For which of the following scenarios is this implementation appropriate?

Select one:

a. The number of elements in the linked list is always small.

b. Elements added to the list often have a lower priority than elements already in the list.

c. All elements have equal priority.

d. The number of elements in the list is always very large.