For an array A of pairwise distinct integers, let Heap(A) denote the max- heap obtained by applying the algorithm Build Heap to A. For example, if A = [1,2,3,4] then Heap(A) = [4, 2, 3, 1]. Construct an array A consist- ing of distinct positive integers such that the numbers 5, 6, 7, 8 appear in A in this order (not necessarily consecutively), but they appear in Heap(A) in the opposite order, that is, 8, 7, 6, 5