Consider the $4$x$4$ problem A x $=$ b at right, for which I have

already ordered equations to create as $$strong$$ a diagonal

as I can $($at least the largest element in each row is on the

diagonal$).$

Starting with the initial guess vector x$0=[010-1]$T $,$ calculate by$-$hand $($and show your work!!$)...$

a$)$ the first two iterations of the solution $($x$1$ and x$2)$ using the Jacobi iteration method.

b$)$ the first two iterations of the solution $($x$1$ and x$2)$ using the Gauss$-$Seidel iteration method.