show the number of passes, comparisons, and swaps for the above algorithms. In insertion sort, consider each shift as a swap.

Insert a table for much easier

Sort the following array in ascending order and show the steps (passes) during the sorting process: Sort the array using: 1. Improved bubble sort (1 Pt.) 2. Improved selection sort ( 1 Pt.) And show the number of passes, comparisons, and swaps for the above algorithms. In insertion sort, consider each shift as a swap (2 Pts.)