Consider the linear programming problem formulated as follows:

max 10x + 20y (objective function)

subject to 5x + 10y 20 (constraint 1)

2x + 5y 20 (constraint 2)

10x + 2y 30 (constraint 3)

x, y 0

Which of the following statement(s) is/are false? (There can be multiple false statements.)

The feasible value of x can be at most 3.

The shadow price for constraint 2 is 2.

(x, y) = (3, 4) has the largest objective function value among feasible solutions.

(x, y) = (1, 0.5) is feasible.

(x, y) = (0, 0) has the smallest objective function value among feasible solutions.