GAMS CODE will be written !!!

Gotham City has been divided into eight districts. The time in minutes) it takes an ambulance to travel from one district to another is shown in Table. The population of each district (in thousands) is as follows: district 1, 40; district 2,30; district 3,35; district 4, 20; district 5, 15; district 6, 50; district 7,45; district 8,60. The city has only two ambulances. 1 5 1 4 6 4 3 4 lon 3 4 5 6 7 8 om +0000 2 3 0 5 4 8 6 12 3 4 5 0 2 2 3 5 7 2 3 0 0 3 2 NOW 0000 6 9 6 3 2 2 0 3 2 7 8 12 5 5 2 3 0 2 8 10 9 7 4 4 2 2 10 4 Ministry of health wants to learn how many ambulances are needed for Gotham City to reach all citizens in 3 minutes. Formulate an integer linear program. We will preprocess and determine the districts which are within 3 minutes to each other. A new parameter e, is defined which takes the value 1 if district i is far from district j not more than 3 minutes. 0 AUWN 1 1 1 0 0 0 0 0 0 2 3 4 5 6 7 8 2 1 1 0 0 0 0 0 3 0 0 1 1 1 1 0 5 0 0 1 1 4 0 0 1 1 1 1 0 6 0 0 1 1 1 1 1 1 7 0 0 0 0 1 1 1 8 0 0 0 0 0 1 1 Old 1 1 0 lo 0 Same indices, parameters and decision variables given in part a. Z* = Minimize Z = Subject to {0,4 21,4 * 1 y,s are binary forvi