In the computer network given below, delays between the routers are given in milliseconds. a) Apply Dijkstra's algorithm for Router A. In applying the algorithm, establish a table with the labels showing the minimum delay value and the corresponding path from Router A to all other routers for each iteration step. b) Briefly explain at which iteration and why the algorithm ends. c) Indicate which labels will be stored in the routing table of Router A. F 1 2 H 4