The following is the current simplex tableau of a given maximization problem. The objective is to maximize 2x_1 - 4x_2, and the slack variables are x_3 and x_4. The constraints are of lessthanorequalto type. (a) Find the unknowns a through g. (b) Find B^-1 and C_B^T B^-1. (c) Find the partial differential x_3/partial differential x_2, partial differential z/partial differential b_1, partial differential z/partial differential x_4, partial differential z/partial differential b_2. (d) Is the current tableau optimal? If not, bring it to optimal. The following is the current simplex tableau of a given maximization problem. The objective is to maximize 2x_1 - 4x_2, and the slack variables are x_3 and x_4. The constraints are of lessthanorequalto type. (a) Find the unknowns a through g. (b) Find B^-1 and C_B^T B^-1. (c) Find the partial differential x_3/partial differential x_2, partial differential z/partial differential b_1, partial differential z/partial differential x_4, partial differential z/partial differential b_2. (d) Is the current tableau optimal? If not, bring it to optimal