The following linear programming problem has _________________.

Min Z = 4x₁ + 12x₂

Subject to:

2x₁+ 4x₂ 20

5x₁+ 15x₂ 25

6x₁+ 14x₂ 32

x1 3

x₁, x₂0

Please choose the option that would best fit the empty space above:

Group of answer choices

only one optimal solution

multiple optimal solutions

no solution, since it is infeasible

no best solution, since it is unbounded

None of the above