5. Verify the correctness of the Selection Sort algorithm (ascending order) using induction. Algorithm: for j 1 to length (A)-1 { for i-j+1 to length (A) if A[i]>A[i] // if this is true, swap A[i] and A[j] } key=A[j] A[j]=A[i] A[i]=key } }