Use MATLAB Please

Exercise 7.3." For the following linear program, construct an equivalent standard-form problem in which the objective function is minimized and the constraints have the form Ax=b,x0. Starting at the vertex where all slack variables are basic, solve the problem using the standard-form simplex method (Algorithm 5.1, p. 121, in the Class Text). At every iteration, record (i) the values of the basic variables; (ii) the indices of the basic and nonbasic variables; (iii) the multiplier and the reduced cost vector zN (iv) the search direction pE; and (v) the step to the nearest constraint. maximizesubjectto10x1+32x2+48x3+54x42x1+3x2+5x3+x4245x1+2x2+x3+3x4328x1+5x2+6x3+10x4643x1+6x2+9x3+12x481x1,x2,x3,x40