Question 4 Recall that an ILP (integer linear program) is a linear program where the decision variables are constrained as integers. Now consider the following ILP: max 1.00x1 + 0.6422 such that 50x1 + 31x2 -4 X1, X2 > 0 and integer. (a) By using the graphical method, solve the linear program that results by ignoring the integer constraints (this is called the linear programming relaxation of the ILP). (b) One potential method for solving an ILP is to solve the corresponding linear pro- gram before rounding the answers to the nearest integer. Do you think this is an effective method? Give reasons for your