Answer the question based on the information given below:
A significant amount of traffic flows from point S to point T in the one-way street network shown below. Points A, B, C and D are junctions in the network, and the arrows mark the direction of traffic flow. The fuel cost in rupees for travelling along a street is indicated by the number of adjacent to the arrow representing the street.
Motorists travelling from point S to point T would obviously take the route for which the total cost of travelling is the minimum. If two or more routes have the same least travel cost, then motorists are indifferent between them. hence the traffic gets evenly distributed among all the least cost routes.
The government can control the flow of traffic only by levying appropriate toll at each junction. For example, if a motorist takes a route S-A-T (using junction A alone), then the total cost of travel would be Rs $14$ (ie., Rs $9 +$ Rs $5)$ plus the toll charged at junction A.
If the government wants to ensure that all routed from S to T get the same amount of traffic, then a feasible set of toll charged (in rupees) at junctions A, B, C and D are respectively to achieve this goal is
- $0, 5, 2, 2$
- $0, 5, 4, 1$
- $1, 5, 3, 3$
- $1, 5, 3, 2$
- $0, 4, 3, 2$