Need step-by-step solution via Excel Solver. From Chapter 7 of Introduction to Manage Science: A Modeling and Case Studies Approach with Spreadsheets (Fredrick Hillier, 6th Edition.) Please open attached JPG for full question. Many thanks.

A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The rm's goal is to maximize the net present value oftheir decision while not spending more than their currently available capital. Max 20x1 + 20x2 +15x3+ 30x4 st. 9x1 + 112 +1313 + 5x4 5 19 [Constraint 1] x1 +x2 +x3 + x4 2 2 [Constraint 2} x1 + x2 5 1 [Constraint 3] x1 + x3 2 1 [Constraint 4] x2 = x4 [Constraint 5] { 1, if location 3' is selected 3- = J 0, otherwise Solve this problem to optimality and answer the following questions: 3. Which of the warehouse locations willi'will not be selected? Location 1 will Location 2 will Location 3 will Location 4 will b. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.} Net present value I I c. 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.) Avaiable capital [