2. 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 "to eliminate not only ajkfor i -k+1,...,n but also the elements aik, for i = 1, k-1, i.e., all elements in the kth column other than the pivot. Upon reducing (A |b) into (k-1) (k-1) (k-1) (n-1) (n-1) 0 0 (n-1) (n-1) 0 0 0 a(n-1) (n-1) the solution is obtained by setting (n-1) This procedure circumvents the backward substitution part necessary for the Gaussian elimi nation algorithm (a) 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. (b) Show that the Gauss-Jordan method requires n3 + O(n2) floating point operations for one right-hand-side vector b-roughly 50% more than what's needed for Gaussian elim nation