Suppose we wish to use a priority queue inside another algorithm, where we know there will be n Insert operations n^2 Change-Priority operations, and n Extract-Max operations. Which data structure should we use to implement the priority queue in order to minimize the asymptotic expected running time? Binary heap, as seen in class (augmented with a hash table to allow O(log n) change-priority operations) Sorted list (as 1 question above) Hash table (as two questions above)