Consider a hybrid sorting algorithm that combines Mergesort with Insertion Sort. It uses Mergesort until the number of elements in the input becomes smaller than or equal to 8, after which it switches...

Consider a hybrid sorting algorithm that combines Mergesort with Insertion Sort.
It uses Mergesort until the number of elements in the input becomes smaller than or equal to 8, after which it switches to Insertion Sort. What is the number of key comparisons performed by this hybrid sorting algorithm in the best case when running on an input array of size n? Briefly justify your answer. You could assume n = 2k, k is more than 3