1200 vehicles travel every day from Point $A$ to Point $Z$ on a network of one-way roads as shown in the diagram below.
Points $B$, $C$, $M$, $D$ and $E$ are junctions in this network. The number adjacent to the ray depicting each road stands for the cost (in rupees) of travelling on that road. Each vehicle takes the path of least cost from $A$ to $Z$.
If two or more paths have the same cost, then the vehicles are distributed equally on those paths.
Common Information Question: 2/4
Which junctions together have the maximum traffic each day?
B and C
D and E
D and M
M and E
B and E
Error(s) Found !!!