Solve the following model using linear programming (allow for continuous values) and determine the values of the decision variables and objective function. Then round the decision variables values down to the nearest integer and determine the value of the decision variables and objective function, this is an approacimate answer to solving the model using integer programming. Observe if the rounding provides a feasible solutio n s are the finally solve the model using integer programming and determine the values of the decision variables and the objective function using integer constraints. Observe the differences in the answers using the three methods Maximize Z 3x + 1x2 + 43 subject to 1x1 + 1x2 + x3 58 -2x1 + 1x2 + 1x354 - 1x1 + 1x2 + 1355 x1.x2.30 LP Method Round Down Method xt IP Method