Note: This problem requres the use of a linear programming application such as Solver - Analytic Salver The university administration would like to add some additional parking locations. To make everyone happy they would like each buicing to be within 5 minute walk of one set of new parking spaces the spaces will be added in blocks of 10 parking spaces). The university is considering sx locations for the new parking spaces, but would Ike to minimize the overall cost of the project. In addition to the walking time requirement, the university would ike to add at least 40 new parking spaces at least 4 blocks of 10). To help with the decision, the management Science department formulated the following Incar programming modat Mir 400x1 + 375x2 + 125x3 + 350x4 +10x5 + 500X6 + X X62 [Residence Hall A constraint x1 + xy + xy 1 Residence Hal B constraint x + x5 + 6 2 1 Science bulcing constraint X] + 4 + x 1 Music buicing constraint x2 + x3 + x4 1 Mach building constraint x3 + x4 + XS 1 Business bulding constraint x2 + x + Xl Auditorium constraint + x4 + X 1 Arena constraint x1 + x2 + x3 + x4 + x + x64 Total ocations constraint 1, if location as selected otherwise Set up the problem in Excel and find the optimal solution. Which locations are selected? Multiple Choice 0 Lucw1,45 Locations 1,3 and 5 Los 1,2,4, ands Locations 23, 4, and 5 I news 1,2,3 m