Which of the following data structures provides the best overall runtime efficiency for implementing the Priority Queue ADT interface when the smallest element in the queue must be removed first? O a linked queue a circular array-queue O a min-heap O a max-heap
