Due Sun 10/29, 11pm Implement algorithm 6.1 that accomplishes Gaussian elimination with row swap ping. INPUT mllmler of unknowns n; and the argument matrix A = layl, where OUTPUT: solation Step 1: For i- 1 to n-1 do steps 2-4 Step 2: Let p be the smallest integer with i p n and Spi0. If no integer p can be found then output (no uniqae solution') STO Step 3: If then perform swap the p-th row and i-th row Step 4: For j =i+1, nclo steps 5 and 6 Step 5:Set m-aa Step 6: Perform (E,-my,E,) E, where E, represents j-th row orj-th equation Step 7: If athen OUTPUT('no unique solation exists): STOP Step 8: Set zn =@n,n+1/amn. Step 9; For i-n-1, ISet z.-lai,n+1 _ ..+1@yz,] /@w Step 10 OUTPUT (zi,Z2, z\"). STOP Use the above algorithm to solve the system of equations