The university administration would like to add some additional parking locations. To make everyone happy, they would like each building to be within a 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 six locations for the new parking spaces, but would like to minimize the overall cost of the project In addition to the walking time requirement, the university would like 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 linear programming model: Min 460x + 415xz + 455x3+ 500x, + 500xs + 420xg s.t x1 + x2 + xg + x6 2 1(Residence Hall A constraint) x1 + x2 + x3 2 1 (Residence Hall B constraint) x4 + xg + x6 2 1 (Science bulding constraint) x1 + x4 + x5 2 1 (Music bullding constraint) x2 + x3 + x4 2 1 (Math building constraint) x3 + x4 + x5 2 1 (Business building constraint) *2 + x5 + *6 2 1 (Auditorium constraint) x1 + x4 + x6 2 1 (Arena constraint) x1 + x2 + x + x4 + x5 + x6 2 4 (Total locations constraint) S 1, if location j is selected Xj%= 0, otherwise a. What is the minimum the university can spend and still meet its goals? (Round your answer to the nearest whole number.) b. Which of the locations will be selected? Location 1 will Location 2 will Location 3 will Location 4 will Location 5 will Location 6 will