The Branching Part of the Branch and Bound Algorithm That

Multiple Choice

The branching part of the branch and bound algorithm that Solver uses to solve integer programming models means that the algorithm:

A)  creates subsets of solutions through which to search 
B)  searches through only a limited set of feasible integer solutions 
C)  identifies an incumbent solution which is optimal 
D)  uses a decision tree to find the optimal solution