Consider the following linear program P2 with two resources and three activities. The resources are in the amounts of 30 and 24 and the activities are represented by the three variables x1, x2 and x3. Z= 2x1 + 4x2 + 3x3 (0) Maximize subject to X1 + 3x2 + 2x3 0, x2 > 0, X3 > 0. (1) (2) X1 + Let x4 and xs denote the slack variable for functional constraint (1) and (2), respectively. After we apply the simplex method, the final simplex tableau is Coefficient of: Basic Right Variable Eq. Side Z (0) 0 0 54 (1) 0 0 2 1 -1 6 (2) 0 1 0 -1 2 18 N X2 X3 X4 X5 X1 0 1 1 1 X3 1 X1 -1 (b) Write the defining equations of the optimal corner point. x2 = 0, x1 + 3x2 + 2x3 = 30, and x1 + x2 + x3 = 24