Consider the following array: $\{70,65,11,30,12,80,110,1,90\},$ We need to know whether HeapSort or MergeSort is the most efficient sorting algorithm without using extra place $($inplace sorting$).1)$ The Most efficient algorithm is the algorithm that needs the minimum number of swaps. $2)$ Write the code to prove the correctness of your answer.