Python heapq Quiz: heappushpop, heapreplace and Top-k

Python heapq Quiz: heappushpop, heapreplace and Top-k

Choose one answer. Each attempt draws 10 of 20 questions; the practice pass mark is 8/10. Original topic practice, not an official exam. Python 3.12 min-heaps: replacement, empty heaps, priorities and bounded top-k selection.
1 of 10
What can happen when equal-priority entries are (priority, dict_task) tuples?