Question textRecall Dijkstra's algorithm. We provide it below, as given in the course notes. [table] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | function DIJKSTRA(G = (V, E), s) dist[1..n] = ∞ pred[1..n] = 0 dist[s] = 0 Q = priority_queue(V[1..n], key(v) = dist[v]) while Q is not empty do u = Q.pop_min() for each edge (u, v) that goes from u to a node v still in the queue do // Priority queue keys must be updated if relax improves a distance estimate! RELAX((u, v)) return dist[1..n], pred[1..n] function RELAX((u, v)) if dist[v] > dist[u] + w (u, v) then dist[v] = dist[u] + w (u, v) pred[v] = u [/table] Given the undirected graph below, in which order will Dijkstra's algorithm pop vertices out of its queue with ? 2 4 1 3 10 2 5 8 4 7 6 1 a b c d e f g List the vertex indices in the order they are popped out of the queue. In case multiple vertices have the minimum key in the priority queue, break this tie by using the smallest index. Answer 1 Question 2[input] → Answer 2 Question 2[input] → Answer 3 Question 2[input] → Answer 4 Question 2[input] → Answer 5 Question 2[input] → Answer 6 Question 2[input] → Answer 7 Question 2[input]多项填空题