Consider the following linear programming problem: Min: 6X1 + 3X2 Subject to: 2X1 + 4X2 >=400 4X1 + 3X2 >=400 X1, X2 >=0 This problem : Select one: a. Has a unique optimal solution b. Has an infeasible region c. Has an unbounded solution d. Has alternate optimal solutions