(2) 3. (10 points) The following linear programming problem has no feasible solution. min Ox: + 0x2 s.t. 3x1 + 2x2 > 30 (1) 2x + x2 > 40 5x + 3x, 350 (3) X1, X2 20 Assume that we have . the penalty cost $100 for failing to satisfy 1 unit of 30 in the 1st constraint; the penalty cost $50 for failing to satisfy 1 unit of 40 in the 2nd constraint; also $10 penalty is assessed for each unit exceeding 50 in the 3rd constraint. Please add some deviational variables on these three constraints to formulate this problem as a goal programming problem to minimize the penalty cost (just write a linear programming model with explanations on new variables)