Here is pseudocode for an algorithm that takes an nxm matrix, A, and outputs a row-eschelon form of the matrix: 1; %This counter will hold the row number in which we are %looking for a pivot. In the nonsingular case, this was %always equal to the current column number, but here we need %to track it separately, since as soon as we have a failure column (i.e. a free variable), our pivots vill no longer be %along the diagonal. %iterate over columns for j#1:n if A(k,j) equals 0 %search for a valid pivot look for a row number in %If k>n then we have run out of rows and the algorithm should halt %The following break will halt the outer loop over j. break; end end Implement this pseudocode as working Matlab code (its already pretty close to working code)