4 2 5 In the computer network given in Figure 2, both way delays between the routers are given in milliseconds. a) Apply Dijkstra's routing algorithm for Router 1. In applying the algorithm, use the below given table to write the labels showing the minimum delay (D) value and the corresponding route definition from Router 1 to all other routers for each iteration. (Label: Minimum delay, route definition). (16p) b) Briefly explain when the algorithm ends. (2p) c) Indicate which labels will be stored in the routing table of Router 1. (2p) 1 3 5 1 Figure 2 Answer a) Dijkstra's algorithm for Router 1. (16p) Iterations Set M D2, Route 1 D3, Route D4, Route Ds. Route D., Route