Consider a network with nodes 1, 2, 3, 4, 5 and 6. The nodes are connected with directed arcs as shown in the table below. The respective costs (in INR) incurred while traversing the directed arcs are also mentioned.
|
Directed arcs
|
Cost (in INR)
|
|
1 $\rightarrow$2
|
3
|
|
1 $\rightarrow$ 3
|
9
|
|
2 $\rightarrow$4
|
3
|
|
2 $\rightarrow$5
|
2
|
|
3 $\rightarrow$2
|
2
|
|
3 $\rightarrow$4
|
4
|
|
3 $\rightarrow$5
|
8
|
|
4 $\rightarrow$5
|
7
|
|
4 $\rightarrow$6
|
2
|
|
5 $\rightarrow$6
|
2
|
The second shortest path from node 1 to node 6 (i.e. the path that has the second least total cost and does not use any part of the shortest path) has total cost (in INR) of
(a) 7 (b) 8 (c) 15 (d) 19