The owner of the Consolidated Machine Shop has $10,000 available to purchase a lathe, a press, a grinder, or some combination thereof. The following 0-1 integer linear programming model has been developed for determining which of the three machines (lathe, x; press, x2; grinder, x3) should be purchased in order to maximize the annual profit: maximize Z = 1,000x + 700x + 800x3 (profit, $) subject to 5,000x + 6,000x2 + 4,000x310,000 (cost, $) X1, X2, X3 0 or 1 Solve this model using the branch and bound method.