Computerizing list (in appropriate order) the operations you would need to use to instruct a computer to solve Ax̅ = b̅ by Gauss Jordan elimination:
1. In the 2 ( 2 case,
2. In the 3 ( 3 case
The strategy used in Example 3 is a good start for Problems 74 and 75, but it needs to be refined to meet all the formal rules for RREF and to carry out appropriate solutions in all the RREFs that might result. That is, explain how to deal with the coefficients in a given system to carry out the Gauss-Jordan steps. You need not worry about writing in an actual programming language, but you should list a set of steps to do the job.
This is called "Pseudocode"?