A traveler is trying to determine the fastest way to travel from city A to city Z. The possible travel routes, with the time required for each segment, is shown below. What is the shortest path and what is the shortest possible time to travel from A to Z? (Round your answer to the nearest whole number.)

Shortest Path Choices: A-B, B-E, E-Z ; A-C, C-Z ; A-B, B-D, D-Z

Shortest Path : A-C, C-Z

Shortest possible time = 143

Step-by-step explanation:

P.S - The exact question is -

Given -

T1 = 38

T2 = 52

T3 = 63

T4 = 67

T5 = 91

T6 = 62

T7 = 64

To find - What is the shortest path and what is the shortest possible time to travel from A to Z ?

Proof -

Choices for shortest path is -

Choice 1 : A-B, B-E, E-Z ;

Choice 2 : A-C, C-Z ;

Choice 3 : A-B, B-D, D-Z

Now,

For Choice 1 : A-B, B-E, E-Z

Distance between A-B = T1 = 38

Distance between B-E = T4 = 67

Distance between E-Z = T7 = 64

So,

The distance = 38 + 67 + 64 = 169

Now,

For Choice 2 : A-C, C-Z

Distance between A-C = T2 = 52

Distance between C-Z = T5 = 91

So,

The distance = 52 + 91 = 143

Now,

For Choice 3 : A-B, B-D, D-Z

Distance between A-B = T1 = 38

Distance between B-D = T3 = 63

Distance between D-Z = T6 = 62

So,

The distance = 38 + 63 + 62 = 163

∴ By comparing we get

Shortest Path = A-C, C-Z

Shortest possible time = 143

4 candies

step-by-step explanation:

7 x 28 = 196

200 - 196 = 4 candies remaining.