Suppose a few elements are inserted into a min-heap, based on the following order: 2726251917190336 Write the sequence of elements in an array that represents the resulting heap after all el Determine the average-case time complexity of performing heap sort. Select one: (log(n))(n2)(nlog(n))(1)(n) Suppose a few elements are inserted into a max-heap, based on the following order: 2671231990361725 Write the sequence of elements in an array that represents the resulting heap after all eleme The following sequence contains elements of array that represents binary tree of a heap: 241551346396776493 Determine if it is a min-heap or max-heap. Select one: max-heap min-heap