Extra Credit Write a code that RUNS, which does the following. Use Gaussian elimination on the lower triangular part of the matrix AND the upper triangular part of the matrix. The end result is that everything except the main diagonal becomes zeros and then solving for x is very straightforward. This is called the Gauss-Jordan form. To get credit, you must print out your code from a computer run that shows me it successfully worked. Note: The first part of your code reduces the augmented matrix to an upper 0 triangular system: (x represents a 0 number) 0 0 0 0 X X X X X X X OOOX X OOX X X X X X X The second part of your code reduces this system to a diagonal system: 0 0 0 0 O XOOO OOXO 0 0 0 0 0 0 0 0 X X X X X 0 21 Show me the results by solving this matrix system: 5 98 1 3 11 -12 13 4 8 2 9 -1 -2 2 4 8 9-10 13 10 -3 9 6 -14 22 13 40 21 60 32 8 24 25 28