I dont have enough time for assignment please help !!

can you solve quickly please !!!

$3 Given the optimal solution (also feasible) of an LP below: Z x1 X2 X3 5 4 8 0 -5 1 0 5 4 4 4 7 s1 0 0 s2 0 O RHS 0 7 0 1 0 0 0 1 1 0 6 3 a) What are the basic and nonbasic variables? b) What are the primal and dual optimal solutions? c) Give the mathematical model of your primal LP (except for the objective function) for the values that you can be sure of. What other information do you need to fill the missing parameters of the original LP? (again, except for the objective function) d) which constraint(s) of the primal model is/are binding? Why? Use complementary slackness for the explanation. e) Now, assume that the dual of the primal LP is unbounded. What could be inferred from the argument and the optimal solution above? Explain each separately. f) Considering part e, is it possible to apply the Dual Simplex Method? If so, what are the options? Determine all possible entering/leaving varibles and the pivoting element? If there is not any option, why? Explain. Consider the following changes to the originally given optimal simplex tableau of Question 2. a) Anew constraint of 4x1-4x2 +9x3 24 is introduced to the model. Determine the new optimal simplex tableau and give the optimal solution. b) What is the shadow price of the constraint that is introduced in part (a)? c) Assume that updating the resource availability of the constraint in part (a) to 5 is possible as it is in the allowablerange. Would you be willing to pay $3 for this update? $3 Given the optimal solution (also feasible) of an LP below: Z x1 X2 X3 5 4 8 0 -5 1 0 5 4 4 4 7 s1 0 0 s2 0 O RHS 0 7 0 1 0 0 0 1 1 0 6 3 a) What are the basic and nonbasic variables? b) What are the primal and dual optimal solutions? c) Give the mathematical model of your primal LP (except for the objective function) for the values that you can be sure of. What other information do you need to fill the missing parameters of the original LP? (again, except for the objective function) d) which constraint(s) of the primal model is/are binding? Why? Use complementary slackness for the explanation. e) Now, assume that the dual of the primal LP is unbounded. What could be inferred from the argument and the optimal solution above? Explain each separately. f) Considering part e, is it possible to apply the Dual Simplex Method? If so, what are the options? Determine all possible entering/leaving varibles and the pivoting element? If there is not any option, why? Explain. Consider the following changes to the originally given optimal simplex tableau of Question 2. a) Anew constraint of 4x1-4x2 +9x3 24 is introduced to the model. Determine the new optimal simplex tableau and give the optimal solution. b) What is the shadow price of the constraint that is introduced in part (a)? c) Assume that updating the resource availability of the constraint in part (a) to 5 is possible as it is in the allowablerange. Would you be willing to pay $3 for this update