Please solve this Question and explain the steps.

This question is concerned with the following linear program: Minimize 10x1 + 2.12 3.13 + 14+ 5.05 Subject to 21 + 12 5.73 + 924 + 12.25 = 62 4.01 + 13 4.15 = 31 7:01 2:02 +2.13 - 12.05 = 67 11,...,.05 > 0 CA Suppose that 21, 23, 24 are currently the basic variables, and that the current basic solution is 2b = (x1, 13, 14) = (9,2, 7). a: What nonbasic variables are candidates to enter the basis? b: If xs 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