a) At which positions of a heap might the third smallest key be stored, root? Leftchild or rightChild of a root or some other node?

b) Would you use the unsorted list, sorted list or heap based structure to implement a priority queue if you need to answer the query RemoveMin() as fast as possible, no matter how much space you use or the efficiency of the other operations? Justify your choice.