For the given network (Figure 1) below, find the least-cost path between the two servers, using Dijkstra's algorithm. You need to show the calculation steps in tabular form as shown in the presentation slides. In addition, show the final shortest path between these two servers as mentioned in the first example of the presentation slide. 4 D C 6 Server 1 3 Server 2 A 1 3 2 B 9 2 E F 1 5 Figure 1: Network Example for Question 1 The network shown in Figure 2 is a snapshot of a practical network consisting of seven routers. The load on each link is normalized to a number indicated on that link. Find the least-cost path between the two routers R1 and R7, using Dijkstra's algorithm. You need to show the calculation steps in tabular form as shown in the presentation slides. You are also required to show the final shortest path between the source and destination nodes. 12 8 1 R2 R4 R5 13 3 3. 3. 4 4 1 R7 8 3 7 R1 R3 R6 9 Figure 2: Network Example for Question 2.