Use a graphing calculator or a computer program for the simplex method to solve this linear programming problem. X2 X3 x4 $1 $2 0 0 .375 .625 1 0 0 480 0 .75 5 .375 0 1 0 580 1 25.125 0 0 0 1 330 90 -6560-50 0 0 0 The optimal solution x₁ = ☐, × 2 = ☐, x3 = ☐, and x4 = ☐ produces the maximum value (Do not round until the final answer. Then round to the nearest integer as needed.)