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. Exercise 3. Consider the topology shown in Fig. 1. Create the minimum spanning tree starting from node z and draw the resulting tree. Is the resulting tree same as the one we constructed in Exercise 2? Justify your answer. 14 10 5 5 Figure 1: Figure for Ex.2 and Ex.3