Indicate the time efficiency classes of the three main operations of the priority queue implemented as

a. an unsorted array.

b. a sorted array.

c. a binary search tree.

d. an AVL tree.

e. a heap.

(note: the three operations are findMax, deleteMax, and insert)

From 6.4 Question 4 of Introduction to the Design and Analysis of Algorithms 3rd Edition