Given a $7-$element array, say $\{$x$1,$ x$2,$ x$3,$ x$4,$ x$5,$ x$6,$ x$7\},$ how many comparisons do

you need to sort the array by the mergesort for the best case?