do not copy other wrong solutions. you very much in advance! : )
1 avengers, assemble! thanos is here! once again, earth is relying on the avengers for protection. for convenience, the united nations has divided up the world into 8 different zones: north america (na), south america (sa), eurasia (eu), north africa (nf), south africa (sf), east asia (ea), south/west asia (wa), and oceania (oc). the number of hours required to get from each zone to each other zone by quinjet is given in the following table: sf 10 sa 5 0 110 9 15 12 13 eu 7 11 04795 19 nf 8 1040383 18 sf| 10| 9| 7| 3| 0| 10| 4| 16 ea 15 1598 1003 7 wa | 11 | 12| 5| 3| 4| 3| 0| 15 oc 16 13 19 18 16 7150 a rough estimate of the population in each district (in millions as follows: na: 580, sa: 420, eu 900, nf: 250, sf: 200, ea: 1700, wa: 400, oc: 40. the un have declared there are going to be n avenger locations. the problem is, the un isnt sure how many of the avengers will be available during the defense against thanos. their goal is to maximize the number of people that live within 3 hours of an avenger. we have been asked to assist the un by determining where to place the avengers for different values of n. solve the problem for n - 1,2,3,4. upload your code as hw6-1.jl