This question is about WANs (Wide Area Networks)

The network graph below shows a series of nodes (routers) with links between them.

There is a weight (distance) shown for each link in the graph. Assuming the source is node 7, fill in the two tables below to show how node 7 would use Link State Routing to calculate shortest paths and therefore build its routing table.

8 8 5 6 7 5 4 3 3 3 1 2 3 4 2 7 Distance D: Next Hop Route R: 1 2 3 4 5 6 7 1 2 3 4 5 6 7 Via 3 Via 3 Via 4 Via 4 Via 6 Via 6