Part 1: Implement the Jacobi algorithm to solve Az = b. INPUT: An nxn matrix A, a right-hand side b, an initial guess x0, tolerance TOL and maximum number of iterations Nmax OUTPUT: An approximate solution x or a message of failure STEP 1: set x - x0; STEP 2: For k = 1,2,..., Nmax do STEPS 3-7 STEP 3: Set xold - x; STEP 4: For i =1,2,...,n do STEPS STEP 5: Set SUM = -sum( Ali, j)*xold()), i -= j) + b(i) STEP 6: Set x(i) SUM/A(1,1) STEP 7: If max(abs(x-xold))