There will be 10 links for every two cities of the given 5 towns.
The formula for the number of combinations is
[tex]\frac{n!}{r!(n-r)!}[/tex]
Where n is the number of objects and r is the number of choosing the objects.
Consider the given 5 cities as A, B, C, D, and E
The pairs we can form:
(A, B), (A, C), (A, D), (A, E), (B, C), (B, D), (B, E), (C, D), (C, E), and (D, E)
Since there are 10 pairs, there will be 10 links between those.
The number of combinations = [tex]\frac{n!}{r!(n-r)!}[/tex]
where n = 5 and r = 2
⇒ [tex]\frac{5!}{2!(5-2)!}[/tex]
⇒ 10
Therefore, there will be 10 links between those 5 cities.
Learn more about calculating combinations here:
https://brainly.com/question/16556229
#SPJ1
