Consider the 6-node network shown below, with the given link costs.

Using Dijkstra's algorithm, find the least cost path from source node (u) to all other destinations. Fill in the given table with the costs for each destination.

Write your costs in th format of "cost, a" where cost is the cost to reach the destination node and "a" is the through node that was used to reach the destination node.

If the node is unreachable mark it as "inf"

If a cost is unchanged mark it with "-"

Fill in the table given below:

3 7 2 8 6 6