8, 3, 4, 5,2, 1,0,9, 7,6] (a) (5 pts) Demonstrate how the insertion sort algorithm works, by 2. Consider the array A showing what A looks like each time the while loop terminates. (CLRS page 18 has the algorithm). (b) (5 pts) Demonstrate how the mcrge sort algorithm works, by show- ing how the array is split for each recursive call, and how the algo- rithm then merges the sorted subarrays. (CLRS page 34 has the algorithm