.

Question 2: Consider the given network of six nodes and assume that each node initially knows the costs to each of its neighbors. Use Dijkstra's algorithm to compute the shortest path from node a to all network. Demonstrate how the algorithm works by computing a table step-by-step and show the final forwarding table with paths and costs to each neighbor 10 a d 7 6 1 f 2 9 5 8 Travel Set D(b).p(b) D(c).p(c) D(d),p(d) D(e),p(e) D(),p(f) a 3,a 6,a 10.a Infinity Infinity