A firm has prepared the following binary Integer program $to$ evaluate a number $of$ potential locations for new warehouses. The firm's

goal $isto$ maximize the net present value $of$ their decision while not spending more than their currently available capital.

Solve this problem $to$ optimality and answer the following questions:

$a.$ Which $of$ the warehouse locations wil$\frac{l}{w}$ill not $be$ selected? $b.$ What $is$ the net present value $of$ the optimal solution?

Note: Round your answer $to$ the nearest whole number.

Net present value

$c.$ How much $of$ the avallable capital will $be$ spent $(Hint$: Constraint $1$ enforces the avallable capital $limit)?$

Note: Round your answer $to$ the nearest whole number.

Available capital