Sequence S = [1, 8, 9, 10, 2, 7, 6, 4] is sorted with the MergeSort algorithm (version from the lecture). Mark the true statements:

The total number of comparisons between the elements of S is: 11

The total number of comparisons between the elements of S is: 14

The last call of the merge() function is for the subsequences: [6, 2, 7, 9] and [4, 1, 10, 8].