[3.47] The following is the current simplex tableau of a linear programming problem. The objective is to minimize -2x4 - x5 -2x6, and x1, x2, and x3 are the slack variables. z x1 x2 x3 x4 x5 x6 RHS Z 1 b C 0 0 h g -12 x6 0 x2 0 23 2 0 -14/3 0 1 1 a 3 d 2 0 5/2 0 5 x4 0 0 e f 1 2 0 0 a. Find the values of the unknowns a through h in the tableau. b. Find B- C. Find Ox2/0x1, oz/Oxs, 0x6/0b3. d. Without explicitly finding the basic vectors a6, a2, a4, give the rep- resentation of the vector as in terms of these basic vectors.