Problem 6. Recently, the discovery of a new data structure WONDEER 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(logn) for binary heaps) a. (4 points) Give 4 algorithms/data structures from CSC 505 which could be improved by WONDER HEAP. b. (4 points) Do you believe in the existence of WONDER HEAPS? Justify your answer. c. (6 points) Give a one-sentence definition of i) worst-case running time, ii) tractable problems, iii) the Subset Sum