1. Using Dijkstra algorithm to determine the shortest paths from router R2 to all other routers as shown in Figure 1.

(15 Marks)

4

2

2

3

R5

R4

R3

R1

1

3

R2

2

R6

3

2

3

Using Dijkstra algorithm to determine the shortest paths from router R2 to all other routers as shown in Figure 1. (15 Marks) R5 3 R1 NI R6 2 2 R2 2 N 3 3 3 4 R4 R3 3 Figure 1 Network Topology