I need help with this problem:

Consider the sorting algorithms insertion sort and merge sort. For each of the following, count the number of comparisons each algorithm must execute to sort the list of numbers.

(a) 1 2 3 4 5 6 7 8

(b) 5 4 3 8 1 6 2 7