Problem 4 [100] Consider the following discrete optimization model AGAIN: Minimize z - 30 X1 + 25 X2 + 10 X3 ST 1 X1 + 1 X2 + 1 X3 S 29 [1] 4 X1 - 4 X2 + 1 X3 S [2] 4 X1 + X2 + 1 X3 2 [3] @ X1 + 6 X2 + 2 X 2 1 X1 + X2 X3 2 N8% [4] [5] X1 E [1, 2.5, 3, 6.5, 9) X2 E [, 2, 4.5, 9.5, 11) X3 & [0, 1, 2, 3, 4,...,13] b) [40] Provide the COMPLETE MILP that will be used to solve this problem using LINDO assuming the minimum number of binary variables and INTEGER (GIN) variables will be used for the integer and discrete variables. CLEARLY define ALL variables used your LINDO Model. WORK AREA LINDO FORMATTED MODEL