(10 pt) Consider the network topology shown below. Compute Dijkstra’s algorithm at node ‘V. Then show the shortest path tree and the forwarding table 7 5 3 2 2 2 Show transcribed image text (10 pt) Consider the network topology shown below. Compute Dijkstra’s algorithm at node ‘V. Then show the shortest path tree and the forwarding table 7 5 3 2 2 2
Answer