Exercise 2. Consider the topology shown in Fig. 1. With the indicated link costs, use Dijkstras shortest- path algorithm to compute the shortest path from u to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3 (Kurose-Ross 6th ed.,page 368). Then show the resulting path. 14 10 6 4 Figure 1: Figure for Ex.2 and Ex.3 step N UX 2x 4y 4y 4y UXy Table 4.3 Ronn is linkskie ckrrk in iu A.2 Hints for Exercise 2 Let's apply the Dijkstra's algorithm to the following network: Lu 2 Figure 4.27 Abstract graph model of a computer network