A firm has prepared the following binary Integer program to evaluate a number of potential locations for new warehouses. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital.

Max $351+352+203+304$

s$.$t$.12$x$1+10$x$2+4$x$3+13$a s $18\{$Constraint $1)$

X$1+$ X$2+$ x$3+42($Constraint $2)$

X$1+$x$21($Constraint $3)$

X$1+31[$Constraint $4)$

$2=4($Constraint $5]$

$*$; $=$

f$1,$ if location j is selected $10,$ otherwise

Solve this problem to optimality and answer the following questions:

a$.$ Which of the warehouse locations will$/$will not be selected?