1. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.)
2. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)

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. Max35x1+25x2+15x3+30x4s.t.7x1+8x2+7x3+13x418{Constraint1}x1+x2+x3+x42{Constraint2}x1+x21{Constraint3}x1+x31{Constraint4}x2=x4{Constraint5}xj={1,iflocationjisselected0,otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected