Math, asked by shaikshama421, 11 months ago

A road network covers some cities. City C can be reached only from the city A or city B. The distance from A to C is 65 kms and that from B to C is 30 kms. The shortest distance from A to B is 58 kms. The shortest distance from city P to A is 420 kms and the shortest distance from city P to B is 345 kms. The shortest distance from city P to city C in kms is:

Answers

Answered by shubhamjoshi033
23

Answer:

The shortest distance from city P to C is 375 kms.

Step-by-step explanation:

As we can see there are only 4 routes from city P to C

a) from P to A and then A to C

So , distance in this route will be

= 420 + 65

= 485 kms

b) From P to B and then B to C

So , distance in this route will be

= 345 + 30

= 375 kms

c) from P to A then A to B and then B to C

So , distance in this route will be

= 420 + 58 + 30

= 508 kms

d) From P to B then B to A and then A to C

So , distance in this route will be

= 345 + 58 + 65

= 468 kms

Hence we can see that the shortest distance from P to C is 375 kms via route b) i.e from P to B and then B to C.

Answered by TooFree
11

Answer:

375 km


Step-by-step explanation:

See Attached.


From the diagram, we can see that the shortest path is:

Route = P to B to C

Distance = 345 + 30 = 375 km


Answer:  375 km

Attachments:
Similar questions