26. If a priority queue is being implemented using an unordered list, what is the Big-O complexity of the IsEmpty operation? B. O(logN) C. O(N) D. ON N) E. not enough information to determine 27. If a priority queue is being implemented using an unordered list, what is the Big-O complexity of the Enqueue operation? B. O(logN) C. O(N) Page 6 D. ON N) E. not enough information to determine 28. If a priority queue is being implemented using an unordered list, what is the Big-O complexity of the Dequeue operation? B. O(logN) C. O(N) D. ON N) E. not enough information to determine 29. If a priority queue is being implemented using a heap, what is the Big-O complexity of the constructor operation? B. O(logN) C. O(N) D. ON N) E. not enough information to determine 30. If a priority queue is being implemented using a heap, what is the Big-O complexity of the IsEmpty operation? B. O(logN) C. O(N) D. ON N) E. not enough information to determine 31. If a priority queue is being implemented using a heap, what is the Big-O complexity of the Enqueue operation? B. O(logN) C. O(N) D. ON N) E. not enough information to determine