You are given a python source file named Problem9.py to implement a set of functions in python to analyze and solve linear systems. This source file is using the Gaussian Elimination algorithm. This algorithm contains four functions including swapRows, relError, rowReduce and forwardElimination. There are two more functions which are needed to complete the Gaussian Elimination algorithm. They are inconsistentSystem and backsubstitution:

backsubstitution: Given a consistent matrix in echelon form, it will return reduced row echelon form

How to write a function in python for back-substitution.

My code so far below.

# stage 2 (backward elimination) #given a consistent matrix in echelon form, return reduced row echelon form def backsubstitution(B): A = B.copy() m,n = np.shape(A); for i in range(0,m): for j in range(0, n-1): pivot = a

----------------------------------------

How do you write python code for back-substitution .