Another way to sort a sequence in O(N log N) time is to use the concept of divide-and- conquer as in the case of the merge sort algorithm. Illustrate step-by-step the operation of the merge sort algorithm as it arranges the following list of characters in ascending alphabetical order (i.e. A precedes B, B precedes C, and so on) ORDERME To do this, trace the execution of the algorithm indicating the sequence of recursive calls and their outputs