which of these statements are true or false?

$1.$ A linear programming problem with $4$ decision variables can always be solved by graphing.

$2.$ the optimal values of the decision variables in a programming problem always take finite values evenif the radical region is infinite.

$3.$a linear programming problem can have multiple optimal solutions