Sort the following array in ascending order and show the steps (passes) during the sorting process: 27 38 20 9 37 16 Sort the array using: 1. Bubble sort (1 Pt.) 2. Selection sort (1 Pt.) 3. Insertion sort (1 Pt.) And show the number of passes, comparisons, and swaps for each algorithm (1 Pt.)