Consider the following array

int[] DataArray={0, 9, 88, 7, 0, 5, 3, 19, 7}

Draw a diagram for each step and illustrate the operation of insertion sort algorithm, which sorts the numbers in ascending order, on the following list of numbers.

Draw a diagram for each step and illustrate the operation of shuffle-left algorithm to clean up ZERO data.

Draw a diagram for each step and illustrate the operation of copy-over algorithm to clean up ZERO data.

Draw a diagram for each step and illustrate the operation of converging-pointers algorithm to clean up ZERO data.