(a) Create a Python function called GaussSeidel that solves a system of linear equations. You may assume that no row exchanges are required. Print the approximate error at each iteration using the L norm. Let the initial guess be a zero vector. The function should return the solution as an array x. def Gauss Seidel (A, b, TOL, N): ***Gauss-Seidel method for systems of linear equations Parameters A: nxn matrix b: vector of right-hand side TOL: tolerance N: maximum number of iterations Returns x approximate solution to Ax = b or 'Maximum number of iterations exceeded' Usage >>> GaussSeidel (A, b, TOL, N, x0) ### YOUR CODE HERE ### (b) Apply the Gauss-Seidel method to the cases below using a tolerance of 10-8 and a maximum number of 30 iterations. Case A: # # # YOUR CODE HERE ### 3x1-2x+x3 + x4 = 0) 0.5x+2x-x+0.5x=1 -2xy-2xy +x=1 x1 x2+2x35x4 = 0.