The For i loop used by the insertionsort algorithm runs from 0 to the array’s last index. What…

The For i loop used by the insertionsort algorithm runs from
0 to the array’s last index. What happens if it starts at 1 instead of 0? Does
that change the algorithm’s run time?

What change to selectionsort could you make that corresponds
to the change described in Exercise 2? Would it change the algorithm’s run
time?

Exercise 2

Write a program that implements selectionsort.