Given an array of 6 numbers [6,8,19,48,9,90]and applying insertion sort, how many swaps must occur before the array is sorted?1 point42 6

Sure, let's go through the steps of the insertion sort algorithm on your array [6,8,19,48,9,90].

1. [6,8,19,48,9,90] - Start from the first element, it is already sorted so no swaps are needed.
2. [6,8,19,48,9,90] - Move to the next number, 8. It is also in the correct place, so no swaps are needed.
3. [6,8,19,48,9,90] - Move to 19. It is also in the correct place, so no swaps are needed.
4. [6,8,19,48,9,90] - Move to 48. It is also in the correct place, so no swaps are needed.
5. [6,8,9,19,48,90] - Move to 9. It needs to be swapped with 48 and 19. So, 2 swaps are needed.
6. [6,8,9,19,48,90] - Move to 90. It is in the correct place, so no swaps are needed.

So, in total, 2 swaps are needed to sort the array [6,8,19,48,9,90] using the insertion sort algorithm.