Write pseudocode for an algorithm that solves systems of linear equations

using complete pivoting. Recall that the complete pivoting strategy searches the en

tire remaining matrix $($not just the column$)$ for the largest entry, and then swaps the

appropriate row and column