QUESTION 2. The Gaussian Elimination with backward substitution algorithm transforms the augmented matrix to triangular form and uses backward substitution to find the solution to a linear system. Consider the following similar algorithm: we transform the matrix into the following diagonal form: 0 a22 and then find the solution from here a) Write the pseudo-code, in a similar fashion to the Gaussian Elimination with backward substitution (b) Count the nmber of multiplications and divisions in this algorithm. What is the most efficient way in terms of multiplications/divisions) to transform the augmented matrix into diagonal form? (c) Implement the algorithm as a computer program. Find the solutions to the linear systems: +2r2 +7r3+-2 0.1?1 + 2.3T2 + 4.9r3-1.5 0.2m + 4T2 + 0.2m = 2 x1 + 2x2 + 0.5r3+ = 1 QUESTION 2. The Gaussian Elimination with backward substitution algorithm transforms the augmented matrix to triangular form and uses backward substitution to find the solution to a linear system. Consider the following similar algorithm: we transform the matrix into the following diagonal form: 0 a22 and then find the solution from here a) Write the pseudo-code, in a similar fashion to the Gaussian Elimination with backward substitution (b) Count the nmber of multiplications and divisions in this algorithm. What is the most efficient way in terms of multiplications/divisions) to transform the augmented matrix into diagonal form? (c) Implement the algorithm as a computer program. Find the solutions to the linear systems: +2r2 +7r3+-2 0.1?1 + 2.3T2 + 4.9r3-1.5 0.2m + 4T2 + 0.2m = 2 x1 + 2x2 + 0.5r3+ = 1