Show that any branch-and-bound algorithm using the linear programming relaxation to compute upper bounds will require the enumeration of an exponential number of nodes when n is odd.
a) True
b) False