1. (20 points) Use Merge Sort to sort the sequence , d, c, h, a, i, b,e,g into increasing (alphabetical) order. Show how the list is divided at each level of recursion all the way down to the maximum recursion level, and then indicate which lists are merged, and the result of each merge. Use Figure 2 in Section 5.4 of the textbook (p. 367) as a general guide; you may draw a similar figure, or answer in text form, as long as it's clear where the splits and merges occur