n IIII 2 in 6 7 30 G 10 0/18 Completed Question 3 Which of these inferences can be made from the following algorithm: ...paths( Graph g, Node s ) initialise....source( g, s) 5:= ( 0 ) Q: Vertices( g ) while not Empty(Q) u := ExtractCheapest(Q); AddNode( S, u ); for each vertex v in Adjacent (u) relax( Node u, Node v, double w[][]) if d[v]> d[u] + w[u,v] then d[v] :=d[u] + w[u,v] pi[v] := u Prim's Krustikal 01: