Please help the question 1& 2, thank you.

5. Sorting pdf -) (+) | 107% [5 marks] Show the steps of MergeSort for the following array of values. Indicate the total number of comparisons made. 1. 12 38 35 10 4 1726 2. 15 marks] Show the steps (insertions) of Insertion Sort for the following array of values. Indicate the number of comparisons for each step (insertion). 22 98 15 30 2 7 3. 15 marks] Show by induction that the number of degree 2 nodes (nr2) in any binary tree is 1 less than the number of leaves (n70 ). 4. 17 marks] Show the steps of Build-Heap (Max Heap) for the values: 10 5 8 61215 1