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. Max20x1+30x2+10x3+15x4s.t.5x1+7x2+12x3+11x421{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? b. What is the net present value of the optimal solution? Note: Round your answer to the nearest whole number. c. How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? Note: Round your answer to the nearest whole number