Answer Happy

Question 5 (20 points) We discussed several implementations of the priority queue in class. Suppose you want to implement a system with many "find the minimum" operations but a relatively small number of "insert" and "remove the minimum" operations. Which of the following priority queue implementations do you think would be most effective, assuming you have enough space to hold all items? (Select all that apply) Unordered array or linked list. Min Heap. Ordered array or linked list based on priority. Regular queue (not priority queue) implemented using a doubly-linked list. Max Heap.