5: Selection sort algorithm is given below. Prove the correctness of this algorithm using loop invariant method. Considering uniform permutation, find the expected number of comparisons and the expected number of swap operations. SeLECTION-SORT(A) 12345678n=A.size()fori=1ton1m=iforj=i+1tonifA[j]iSWAP(A[i],A[m])