Enter T or F depending on whether the statement is true or false. (You must enter T or F -- True and False will not work.)

 1. If the set of feasible points is unbounded, then the linear programming problem has no solution.
 2. There have to be a minimum of 3 corner points in the set of feasible points of a linear programming problem.