IV Heap and Alternative permutation Consider the following list in an array. A=15212117358020 IV.1. Choose the result when the divide and conquer linear time algorithu to construct a min-heap. Hint: the array representation of the min-hropi: IV 2. Choose the result when the inorder depth. first traversal in performed an the min-heap tree found in quention IV.1 1V.3. Consider the alternative permutation (down-up) problem or DUP in short defined formally as follows: Input: A sequence A of n distinet quantifiable elementa, i.e, ai=aj if i=j Output: a permutation A of A such that {ai>ai+1ai