Given the set of integers: {88, 2,9, 36}, how many different MIN HEAPs can be made using these integers? Justify your answer. Heap and Heap property Array A contains integers from 1 to 2047 (including both of them) exactly once and the array is already built as a min-heap. The depth of a node in the heap is defined as the length of the path from the root of the heap to that node. Therefore, the root is at depth 0. What is the maximum depth at which integer 10 can appear? Justify your answer. Heap and Heap property Provide a tight bound for the running time of finding the smallest element in a binary max-heap with n elements? Justify your