A priority queue of size n is implemented as a sorted linked list. Adding an element to its sorted position takes O( n) time. Removing an element takes O (1) time. For which of the following scenarios is this implementation appropriate? Select one: O a. Elements added to the list always have a lower priority than elements already in the list O b. The number of elements in the list is always very large O c. Elements added to the list almost always have a higher priority than elements already in the list. O d. There is never an appropriate scenario to implement a priority queue as a sorted linked list