There are multiple routes to reach from node 1 to node 2, as shown in the network.
The cost of travel on an edge between two nodes is given in rupees. Nodes 'a', 'b', 'c', 'd', 'e', and 'f' are toll booths. The toll price at toll booths marked 'a' and 'e' is Rs. 200, and is Rs. 100 for the other toll booths. Which is the cheapest route from node 1 to node 2?
Tap to open full sizeFigure description
A directed network with circled nodes 1 (far left), a (upper left-centre), b (centre-left), c (upper right-centre), d (centre-right), e (lower right), f (bottom centre-left) and 2 (right). Edges with printed costs: 1->a 200; 1->b 300; 1->f 100; a->c 100; a->2 200 (long diagonal passing below c); c->2 100; b->2 200; b->d 0; d->e 100; f->b 0 (upward arrow); f->e 100; e->2 200 (upward arrow).
- (A)
1-a-c-2
- (B)
1-f-b-2
- (C)
1-b-2
- (D)
1-f-e-2