When would you want to use a priority queue instead of sorting in a greedy algorithm?

Group of answer choices

When the values to be greedy about are changing over the course of execution.

Not all greedy algorithms require choosing the smallest or largest value at each decision point, but those that do must use a priority queue because of the efficiency of ExtractMin.

There's never a reason to use a priority queue instead of a sort; you could always sort repeatedly for the same big$-$O cost$.$

If the greedy algorithm is on a graph, then you must use a priority queue instead of a sort.