Recently, the discovery of a new data structure WONDER HEAP was announced.
A WONDER HEAP has the same functionality and worst case behaviour as a binary heap except for DELETE MAX, which is implemented in O(log log n) (instead of O(log n) for binary heaps)
a. Give 4 algorithms/data structures from CSC 505 which could be improved by WONDER HEAP.
b. Do you believe in the existence of WONDER HEAPS? Justify your answer.
c. Give a one-sentence definition of i) worst-case running time, ii) tractable problems, iii) the Subset Sum Problem.