text is clear

Part 2 - Optimisation #1 A cellular provider, AZ&Z, wants to expand their operations into another country. To do this, they must construct new cell towers. They have decided on seven potential sites for cell tower construction. On the assumption that all cell towers cost the same, they want to minimise the number of cell towers they need to construct There are 15 neighborhoods they would like to cover, and each cell tower covers multiple neighborhoods. The neighborhoods covered by each cell tower are described in the following table: Location Location Covered Neighbors 1,2 2,3,5 1,7,9,10 4,6,8,9 6,7,9,11 5,7,10,12,14 12,13,14,15 Write Mini Zinc or Julia code that determines the cell towers they need to construct. (Hint: Research the Set Cover Problem)