4 This question is concerned with the following linear program: Minimize 10x1 + 212 - 303 + 24 + 505 Subject to C + 12 - 5x3 + 904 + 12:x5 = 62 + 03 - CA - 4:x5 = 31 701 - 2:12 + 2:13 12:15 = 67 Suppose that 21, 23, 24 are currently the basic variables, and that the current basic solution is CB = (21, $3, CA) = (9, 2,7). a: What nonbasic variables are candidates to enter the basis? b: If rs 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