Using merge sort to sort these 10 student names by alphabetical order from a to z. Note, sort in array is faster than sort in linked list.

Using merge sort to sort these 10 student names by alphabetical order from a to z. Note, sort in array is faster than sort in linked list.

A. Draw the tree(on slides, chapter 6-1, page 46) by implementing the divide and conquer concept.(10 points)

B. Submit your code and the sorted result.(15 points)