question 5 please

4. Apply the following sorting algorithms: a. Merge sort to sort the list {20,80,40,25,60,30}. b. Insertion sort to sort the list {4,3,2,10,12,1,5,6} 5. Redesign: a. Merge sort algorithm to divide the n-element sequence to be sorted into three (instead of two) subsequences of n/3 elements each. b. Insertion sort to sort the number in descending order (instead of ascending)