solve part 2

2. (20\%) Consider the network shown in Fig. I. Show the operation of Dijkstra's (Link State) algorithm for computing the least cost path from node A to all destinations step by step. 3. (25\%) Consider the network shown in Fig. 1, and assume that each node initially knows the costs to each of its neighbons. Consider the distance-vector algorithm and show the distance table entries at cach node step by step until the table converges