Can anyone help me to solve this problem? Thanks

6. (10 points) For top-down mergesort on 10 initially sorted items, how many comparisons are made? Also, show an array of the integers 1 through 8 (you determine the order) that will cause as many comparisons as possible between items for merge-sort. (5 points each, show work. Assume that, as in the book, if an odd-sized array is broken, the "big-half" goes first.)