Question

4 cities(A,B,C,D). Road to be constructed for connecting 4 cities but allocated budget allows only 22 km.
How it is possible?

Don't spam ❌ ❌
Please give the solution.
For Brainly stars ✨ ​

Answer 1

Answer:

Step-by-step explanation:

Dark lines is the solution

Answer 2

Connect the cities diagonally

Step-by-step explanation:

From the figure, we find that ABCD is a square with each side 8 KM. In order to connect all four points A, B, C and D, we can draw the two diagonals, BC and AD that meet each other at O. The length of the diagonal is obtained using Pythagoras theorem.

BC = root of (squares of AB + AC) = root of 128 = 11 Km.

So both the diagonals will equate to 22 Km.

These roots will connect all four cities within the available budget.