(Solved): 5.2-5. Dijkstra's link-state routing algorithm (Part 2). Consider the graph shown below and the use ...

5.2-5. Dijkstra's link-state routing algorithm (Part 2). Consider the graph shown below and the use of Dijkstra's algorithm to compute a least cost path from a to all destinations. Suppose that nodes

and

have already been added to

. What is the path cost to the next node to be added to

(refer to the text for an explanation of notation). [Note: You can find more examples of problems similar to this here ?.] 6 4 7