Merge Sort: Given the following unsorted array of characters to start: (18 pts)

[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]
N	E	K	W	D	X	R	B	M	G

and using the merge sort:

EITHER:

For each call, list the recursive calls would be made going forward

When returning, show the ordering of each sublist with more than one value in it, after each recursive call returns.

OR

Show the call and return tree for the sort