Consider a linear programming problem with two variables and two constraints. The objective function is x + 3y. The shaded region is representing the feasible region in the given graph. At which point(s) is the objective function will have the maximum?
1
Point C only
2
Point N only
3
Point C and N
4
Every point on the line segment CN