Given an array of positive integers that represents a max heap, show the array after removing the largest element and fixing the heap (using the same algorithm from class and from your textbook). Set the final element in the array to 0 to indicate that it is empty. Do not create a new array. Just modify and return the given array. When moving a node downward, if both children have the same value, choose the child on the left.