with matlab code please :)

Gaussian Elimination with and without partial pivoting

$($a$)$ Write Matlab code that uses naive Gaussian Elimination for solving the linear

system

$\left[\begin{array}{cc}a& 1\\ 1& 1\end{array}\right]\left[\begin{array}{c}{x}_1\\ x_2\end{array}\right]=\left[\begin{array}{c}1+a\\ 2\end{array}\right]$

for $a={10}^{2k},k=1,2,$dots,$10.$ The exact solution is $x={\left[\begin{array}{cc}1& 1\end{array}\right]}^T,$ regardless

of the value of $a.$ Place the solutions from Matlab in a table. How does the

accuracy of the Matlab $($i$.$e$.,$ the numerical$)$ solution behave as a gets smaller?

Explain.

$($b$)$ Next, change your Matlab code to carry out partial$-$pivoting. What is the Mat$-$

lab solution now $($give a table of solution values$)?$ Explain your result and the

accuracy relative to part $($a$).$