Consider the following optimization problem: MIN:Subjectto:x1+x24x1+4x218x1+11x214x1,x20 (a) What is the optimal solution to this LP problem? (x1,x2)=() (b) Now suppose that X1 and X2 must be integers. What is the optimal solution? (x1,x2)=() (c) What general principle of integer programming is illustrated by this question? The optimal integer solution to an ILP is not, in general, also a basic feasible solution to the continuous LP. The optimal objective function value of a minimization ILP is always smaller than that of the continuous solution. The optimal integer solution to an ILP is, in general, also an optimal solution to the continuous LP. The optimal integer solution to an ILP cannot, in general, be obtained by rounding the continuous solution. The optimal objective function value of a minimization ILP is always higher than that of the continuous solution