a. Let X1= number of shirts produced, X2= number of shorts produced, X3= number of pants produced. Specify the objective function and constraints for the problem. Objective function: Maximize Z=11X1+12X2+25X3 Constraints: Department A: 2x1+2x2+3x3130 Department B: 1X1+3X2+4X3160 Material 2x1+1x2+4x3100 Nonnegativity: X1,X20 b. Alinear programming software shows that all three constraints are binding The optimal solution is (enter your responses rounded to two decimal places): x1=x2=x3=