The Gauss-Jordan method used to solve the prototype linear system can be described as follows. Augment A by the right-hand-side vector b and proceed as in Gaussian elimination, except use the pivot element a^(k-1)_kk to eliminate not only a^(k-1)_ik for i = k+ 1, ..., n but also the elements a^(k-1)_ik for i = 1, ..., k - 1, i.e., all elements in the kth column other than the pivot Upon reducing (A|b into the solution is obtained by setting x_k = b^(n-1)_k/a^(n-1)_kk, k = 1, ...., n. This procedure circumvents the backward substitution part necessary for the Gaussian elimination algorithm. Write a pseudocode for this Gauss-Jordan procedure using, e.g., the same format as for the one appearing in Section 5.2 for Gaussian elimination. You may assume that no pivoting (i.e., no row interchanging) is required. The Gauss-Jordan method used to solve the prototype linear system can be described as follows. Augment A by the right-hand-side vector b and proceed as in Gaussian elimination, except use the pivot element a^(k-1)_kk to eliminate not only a^(k-1)_ik for i = k+ 1, ..., n but also the elements a^(k-1)_ik for i = 1, ..., k - 1, i.e., all elements in the kth column other than the pivot Upon reducing (A|b into the solution is obtained by setting x_k = b^(n-1)_k/a^(n-1)_kk, k = 1, ...., n. This procedure circumvents the backward substitution part necessary for the Gaussian elimination algorithm. Write a pseudocode for this Gauss-Jordan procedure using, e.g., the same format as for the one appearing in Section 5.2 for Gaussian elimination. You may assume that no pivoting (i.e., no row interchanging) is required