We need to clarify the question. Based on what you wrote we can assume that
(1) each town is an hour away from every other town
(2) cars leave once an hour to go to another town at 12PM, 1PM and 2PM
and arrive at 1PM, 2PM and 3PM
(3) the entire transportation network is at the disposal of maximizing
the number of cars that travel directly or indirectly from town A to
town D
For direct travel, at 12PM, 1PM and 2PM, 250 cars an hour leave Town A
for Town D, arriving at 1PM, 2PM and 3PM, for a total of 750 cars.
For indirect travel, we note that 200 cars an hour can leave town A
for town B and 150 cars an hour can leave town A for town C. This
creates no bottlenecks, since 230 cars an hour can travel from town B
to D and 180 cars an hour can travel from town C to D. So all the
cars leaving town A for towns B and C can arrive in town D two hours
later.
So we note that 200 + 150 = 350 cars an hour leave town A for towns B
and C at 12PM and 1PM, leave those towns at 1PM and 2PM, and arrive in
town D at 2PM and 3PM for a total of 700 cars.
So in total 750 + 700 or 1450 cars can leave town A and arrive in town
D in the time alloted. |