2) (20 points) Suppose that we are using the Dijkstra's algorithm to find out the minimal distance from node s to all other nodes in the following figure. The algorithm williterate 5 rounds. In each round, it will identify the minimal distance to one node. Please give out the node identified in each round and the associated minimal distance. 5 2 2 1 2 S 4 1 z 3 1 LO In Iteration 1: the minimal distance to In Iteration 2: the minimal distance to In Iteration 3: the minimal distance to In Iteration 4: the minimal distance to is determined as is determined as is determined as is determined as In Iteration 5: the minimal distance to is determined as