5 insertion sort a) convert the following pseudocode to c++ INSERTION-SORT (A) 12345678forj2tolength[A]dokeyA[j]InsertA[j]intothesortedsequenceA[1j1].ij1whilei>0andA[i]>keydoA[i+1]A[i]ii1A[i+1]key b) show the state of the array a=[6,5,4,3,2,1] after the first 3 iterations of the outer loop ( j index) of your c++ code