A priority queue is a queue in which every element is inserted with a priority. Elements are removed from the queue in order of priority, with elements of the same priority being removed in a FIFO manner. Describe the abstract data type for a priority queue, including the operations you would use. How could you efficiently implement all of these operations? (Hint: you want a data structure from which it is easy to extract the smallest priority.)