This question is concerned with the following linear program: - Minimize Subject to 10x1 + 2.x2 3x3 + x4 + 5x5 X1 + X2 5.x3 + 9x4 + 12x5 = 62 4x1 + 13 4.25 31 7x1 2.x2 + 2x3 12x5 67 X1, ... ,.25 > 0 24 - Suppose that X1, X3, X4 are currently the basic variables, and that the current basic solution is B (1, 73, 74) = (9,2, 7). - a: What nonbasic variables are candidates to enter the basis? b: If x5 is chosen to enter the basis, what happens when you try to determine the leaving variable? c: This problem is unbounded. That is, for every number M, there is a feasi- ble solution with objective value less than M. Find a feasible solution with objective value less than -100000