Suppose that the LP formulation for a particular business problem is a pure binary programming model with decision variables X1, X2, X3, X4, and X5. The formulation has two constraints, as follows. + = X1 + X2 + X3 + X4 + X5 = 3 X1 + X221 . Based on the above information, which of the following solutions would NOT be feasible? O A. X1 = 0, X2 = 0, X3 = 1, X4 = 1, X5 = 1 = O B. X1 = 1, X2 = 0, X3 = 1, X4 = 1, X5 = 0 = O C. X1 = 1, X2 = 1, X3 = 0, X4 = 0, X5 = 1 O D.X1 = 0, X2 = 1, X3 = 1, X4 = 0, X5 = 1 = = O E. X1 = 1, X2 = 1, X3 = 1, X4 = 0, X5 = 0