I need help completing this problem. help please.

COSC 3304 Exercise on Merge sort_420 Points) Reference: Section 2.2 in Algorithms 4/e 1 1. Show, in the style of the trace of Algorithm 2.4 on p. 273, the result of using top-down merge sort to sort the keys: 430 Points) NOTHARDTOMERGESORT ALGORITHM 2.4 Top-down mergesort public class Merge { private static Comparable[] aux; // auxiliary array for merges public static void sort(Comparable[] a) { aux = new Comparable[a. length]: // Allocate space just once. sort(a, 0, a. length - 1): } private static void sort (Comparable[] a, int lo, int hi) { // Sort a[lo..hi]. if (hi