When implementing merge sort it is very important that the auxiliary array will be passed to the recursive method and that it won't be created inside the recursive method. Why? Creating the auxiliary array inside the recursive method is a bad choice because_. it increases the memory usage O it makes the code less clear and harder to read O it both slows down the algorithm and increases the memory usage O it reduces the performance (speed) of the algorithm The first step in heap sort is to 'heapify' a given array Apply the algorithm that we studied in this class in order to 'heapify' the array below. The resulting heap should be a max heap._7 1 4 9 2 6 0 3 8 5 When implementing merge sort it is very important that the auxiliary array will be passed to the recursive method and that it won't be created inside the recursive method. Why? Creating the auxiliary array inside the recursive method is a bad choice because_. it increases the memory usage O it makes the code less clear and harder to read O it both slows down the algorithm and increases the memory usage O it reduces the performance (speed) of the algorithm The first step in heap sort is to 'heapify' a given array Apply the algorithm that we studied in this class in order to 'heapify' the array below. The resulting heap should be a max heap._7 1 4 9 2 6 0 3 8 5