The following is a partition of an integer programming problem with a binary restriction. The following is a partition of a binary-restricted integer programming problem. Maximize Z= 26 + 33X Subject to (1) (2) (3) (4) 3X4 & 2 X451 2X4 + X. S3 Xs is binary If the value of x4 x 1, what can be said about the solution? If the value of x4 is 1, indicate that the solution can be said. The solution is feasible. O to The solution is viable. The solution is infeasible. . The solution is not feasible. Nothing can be said about the solution with the information at hand. Nothing in the solution can be concluded with the information at hand. The solution is inside the viable region. OD The solution is within the viable region