A linear programming problem has two constraints 2X+4Y100 and 1X+8Y100, plus non-negativity constraints on X and Y. Which of the following statements about its feasible region is TRUE? Select one: a. The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized. b. The graphical origin (0,0) is in the feasible region. c. The two corner points are (0,0) and (50,12.5). d. The feasible region is triangular in shape, bounded by (50,0), (33.3333, 8.3333), and (100,0). e. There are four corner points including (50,0) and (0,12.5). here are four corner points including (50,0) and (0,12.5)