Please answer the questions as soon as possible . Thank you .

Suppose a heap is represented by the following array which starts at index 1 : 241551346396776493 Fill in the blanks with the corresponding array elements representing the heap each time after a node is removed while heapsort is performed The following sequence contains elements of array that represents binary tree of a heap: 967793643415632514 Determine if it is a min-heap or max-heap. Select one: max-heap min-heap