you are asked to do algorithm analysis on the insertion sort algorithm( given below): Idea: Find the smallest element in the array Exchange it with the element in the first position Find the second smallest element and exchange it with the element in the second position Continue until the array is sorted

Alg.: SELECTION-SORT(A)

n length[A]

for j 1 to n - 1

do smallest j

for i j + 1 to n

do if A[i] < A[smallest]

then smallest i exchange A[j] A[smallest]

a. Calculate the number of steps for each line of the algorithm

b. Find the final number of steps for the algorithm