Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. Χ1 X2 X3 X4 $1 $2 $3 0 0 .375 .625 1 0 0 510 0 .75 .5 .375 0 1 0 590 1 .25 .125 105-80-75 0 0 0 1 300 - 65 0 0 0 The optimal solution x₁ = ] × 2 = ☐ × 3 = [ and x4 = produces the maximum value (Do not round until the final answer. Then round to the nearest integer as needed.)