Question

If the Organizers want to ensure that all participants travelling from S to T take the same time (travelling time and task time combined) regardless of the route they choose and the street from B to C is under repairs (and hence unusable), then a feasible set of task time (in hours) at junctions A, B, C, and D respectively to achieve this goal is:

• A. 2,5,3,2
• B. 0,5,3,1
• C. 1,5,3,2
• D. Both (b) and (c)

Answer 1

The correct option is D

Both (b) and (c)

As B - C is unusable, S - B - C - T is not possible.
The other possible ways are : S - A - T, S - B - A - T , S - D - T, and S - D - C - T
From these if we apply all the options:
Both option (b) and (c) are true, as in both the cases total time is same for each of the four routes.