Gaussian elimination is one way to calculate the solution of a system of linear equations (2500-3 ann by transforming the matrix A = {a},j=1, to an upper triangular form resulting in all 0 022 0 an-1 n-1 0 30-0 = with modified values a;; and b,. The solution can be recursively computed using backward substitution. The Gauss-Jordan method does not require this final step, because it transforms the original system to diagonal form already: with modified values ai; and bi all 0 0 a22 0 x b B 0 an-1 n-1 0 0 ann (a) Create a Python function called Gauss Jordan to solve a system of linear equations using the Gauss-Jordan method. The function needs to: accept arrays representing matrix A and vector b return the modified augmented matrix and the solution x to Ax = b if there is no unique solution, print a message and return None