We are solving a maximization discrete linear optimization problem $($assume all the variables in the problem are required to by binary$)$ using branch and bound. Solving the root node linear relaxation we find that the $($relaxed$)$ optimal objective is $100.$ What can we conclude about the original discrete problem?

Group of answer choices

The optimal value is less than or equal to $100$

It is unbounded

The optimal value is greater than $100$

We cannot conclude anything with the information at hand