If the total number of items is n, how many operations occur when each merge step in Mergesort Algorithm?

a) Table 1 shows an array of ten registered participants of a concert organized by K-pop Entertainment company. Select a suitable category for you to implement a merge sort operation to answer the questions below. Table 1: List of registered participants of a concert. No Name Seat No Date of Birth Age Package 1 RAJA A1 11/12 21 1 ADLI C7 4/6 28 3 3 NARUTO B3 20/9 20 2 4 SARAH A2 9/9 27 5 AMEER D4 2/3 24 4 6 PRINCESS D8 2/12 25 7 IKHWAN C3 8/3 22 3 8 SIMON C9 3/3 18 3 9 AZIM Аб 2/2 20 1 10 RIZQEEN A9 7/4 24 2.

ANSWER IN ONE NUMBER/WORD/SENTENCE 1.A sorted array contains 300,000 elements. The maximum number of operations needed by binary search to check if an element is present in the array would be   2.The correct statement indicating the recurrence relation for mergesort is Blank 1 302: T(n) = T(n/2) + n 303: T(n) = 2T(n/2) + n/2 304: T(n) = 2T(n/2) + n 306: T(n) = T(n – 1) + 3n 3.Put the most appropriate statement number here   171: Insertion at the end of an array structure takes O(1) time and insertion at the end of a linked list takes O(n) time. 172: Searching the largest element in a random array takes O(log n) 173: Deletion of first element takes O(1) for an array and O(1) for a linked list 174: Searching for mid element takes O(log n) both for a sorted array and a sorted linked list   4.An array contains following elements: 20 42 8 66 12 39 11  26 33 The mergesort method we discussed in the class calls a merge function. The number of times the merge function is going to be called…

Use a merge sort to sort 3,6,9,4,2,10, 8, 1,7,5 into increasing order. Show all steps used by the algorithm