Here is an array of ten integers: 5 3 8 9 1 7 0 2 6 4 a. Draw the array after every iteration in a selection sort (sorting from smallest to largest). b. Draw the array after every iteration in an insertion sort (sorting from smallest to largest). This iteration has shifted at least one item in the array! c. Draw the array after every iteration in a quick sort (sorting from smallest to largest). Draw a circle for each pivot in each iteration. d. ....recursive merge sort... e. ... iterative merge sort.... f. ...heapsort... (show the construction result directly) Why list sort