3.

4.

Using merge sort tree to illustrate the execution of the merge sort algorithm on the following input sequence: (2.5, 16, 4, 10,39, 18, 15). Give an example input list (consisting n elements) that requires merge sort to take Oinlogn) time to sort, but insertion sort runs in O(n) time. Justify your