please do not copy and upload the second solution,,

2. The following is a simplex tableau for a linear programming model: 6 20 12 0 0 Basic Variables 9 Quantity * *2 *3 5 3 6 0 X1 x 12 0 20 10 10 1 1/3 1/3 0 1 0 - 1/6 1/6 0 1 -OOO 3 240 6 10 12 0 -2 29 10 0 0 a. Is this a maximization or a minimization problem? Why? b. What is the solution given in this tableau? c. Is the solution given in this tableau optimal? Why? A THE SIMPLEX SOLUTION METHOD d. Write out the original objective function for the linear programming model using only decision variables. c. How many constraints are in the linear programming model? f. Were any of the constraints originally equations? Why? & What is the value of x in this tableau? Find an slepo The problem being of maximizalian type and all b's being so Call bls aus tur) given table Quantity (20, 10, 10 tue) skep Expuess the problem in the standard tam. stop trutial basic feasible solution (given) Foo x Column (j=1) -27 - Ecoaie 6(1) 41210) +0() -6 Fax colun (8=2) aj: & chais 6(1) +1264)+013) 6+4=10 For Ig - calusar (j=7) aj chain 6 (0)412(1) 40(0) 12 dig ;(6 - 2006) + 10(0) + lol 12) 120 + 0 +120 240 slepo Apply optimality test As j+ IMO SEO Columns steps identity the incoming and adgoing vibles #ve