An alternative solution strategy, also called Gauss–Jordan in some texts, is, once a pivot is in position, to use elementary row operations of type #1 to eliminate all entries both above and below it, thereby reducing the augmented matrix to diagonal form D | c where D = diag(d₁, . . . ,d_n) is a diagonal matrix containing the pivots. The solutions x_i = c_i/d_i are then obtained by simple division. Is this strategy more efficient, less efficient, or the same as Gaussian Elimination with Back Substitution? Justify your answer with an exact operations count.