In the below undirected network, the shortest path algorithm is applied to find the shortest path from node 1 to every other node. At the beginning of the current iteration, nodes 1 and 2 are permanently and nodes 3, 4, 5, and 6 are temporarily labeled with distance and predecessor labels given on the network. Nodes with no labels next to them have a distancelabel of and no predecessor.

[100, 1] 180 [280, 21 6 109 40 VO 70 NO [0, sl 120 80 110, 11 5) 70 18) [120,1] 50 40 160 40 140 150 (4) [160, 1] Question D.1. Which node will be permanently labeled next? a) 3 b) 4 c) 5 d) 6 e) 7 Ekran Resmi Question D.2. After the node to be permanently labelled next has been identified and its label has been made permanent, we update the temporary labels accordingly. Which one of the following is NOT correct? a) Distance label of node 3 is still 120. b) Distance label of node 6 becomes 180. c) Distance label of node 4 is still 160. d) Distance label of node 3 is still 120. e) Distance label of node 7 becomes 160. Question D.3. If we continue the steps of the algorithm, which node will be permanently labeled last? a) 4 b) 5 c) 6 d) 7 e) 8 Question D.4. When the algorithm terminates, which of the following is FALSE? a) Distance label of node 4 is 160. b) Distance label of node 5 is 110. c) Distance label of node 6 is 180. d) Distance label of node 7 is 160. e) Distance label of node 8 is 290. Question D.5. Which one of the following is NOT a shortest path? a) 1-2-5 b) 1-3-4 c) 1-3-4-7 d) 1-2-5-6 e) 1-2-5-6-8