Given an array containing the digits 7 1 8 0 8 2 9 4, show how the order of the digits changes during each step of (30%)

a. insertion sort. (10%)

b. selection sort. (10%)

c. heapsort (using the backward min-heap version discussed in lecture). (10%)

Show the array after each swap, except in insertion sort. For insertion sort, show the array after each insertion.