Use MatLab code please

Exercise 4.1." Consider the equality-constrained lincar program: minimize eTx subjoct to Ax=b. Consider tev problems defined with data: (a) A=(1351011412),b=(45), and c=46131. (b) A=336236160201630,b=605, and c=12401. For each of these problems, find a feasible point 2 . Find if z is optimal. If x is not optimal, find unique vectors cNnull(A) and cR range (AT) such that c=cR+cN. Hence find a feasible direction p such that f(x+p)