o demonstrate the weakness of Gaussian elimination without pivoting, give it a matrix for which at least one of the pivots is guaranteed to be small. The easiest way to do this is to use matrices whose (1,1) entry is tiny. Repeat the experiments from part (1) using matrices for which a1.i is tiny. For example, take A = ran(ln(n); A(1, 1) = 50 * eps * A( 1, 1);" MATLAB's machine epsilon eps equals 2u, twice the unit roundoff. For these experiments n need not to be large. Try several choices of n, but n = 2 is already big enough