The following linear programming problem has been solved graphically (each line in the graph is one unit). The feasib region has been indicated by the shading. The corner points and a test point have been provided below. The objectiv function values have been omitted. Minimize: N = 3X + 2X2 Subject 1 10X1 11X2 >= 11 to: 2. X X2 7 3. , + 3X2 >= 42 Non-Neg Constraint 3 Constraint 2 (0,0) Constraint 1 Corner Point Objective Function Value (0.14) ? (4.2.7) ? ? (8.8.7) (9,20) - Test Point ? What solution type is this? Unbounded Multiple Optimal Unique Optimal The answer cannot be determined with the information provided