Linear programming problem. Please include all the steps.

2 (5 points). The initial tableau of a LP problem, maximize z = CH: subject to Am 5 b, a: 2 0, is given as follows -10 29 -7 0 basic variable 3 -8 2 -5 15 -4 1 -3 1 Consider a perturbed LP problem, maximize z = 0%: subject to An; S b, m 2 0, with all the same parameters except for changing on = 3 to 011 = 4. (8.) Apply exactly the same sequence of row operations for the perturbed problem as we did to get to the nal tableau of the unperturbed one. Find the missing numbers for the current tabular form for the perturbed problem. (b) Complete the remaining steps by the simplex method to nd the optimal solution for the perturbed