Question text DP graph algorithms Recall Bellman-Ford. 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 | function BELLMAN_FORD(G = (V, E), s) dist[1..n] = ∞ pred[1..n] = null dist[s] = 0 for k = 1 to n − 1 do for each edge e in E do RELAX(e) print(dist) // This line was added for the test 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 input graph and edge relaxation order: [table] -2 4 5 0 -3 -2 -3 4 2 1 s a b c d | b → c b → d s → a a → d s → b b → a a → b a → c d → c c → a [/table] Give the dist array as printed on line 8 after a single iteration (k=1). Note: If a node's distance is infinity, type inf or infinity. [table] | s | a | b | c | d Print after k = 1: | Answer 1 Question 4 | Answer 2 Question 4 | Answer 3 Question 4 | Answer 4 Question 4 | Answer 5 Question 4 [/table]多项填空题