Consider the problem of solving single-source shortest-paths on the following weighted directed graph:

Let $d[i,j]$ denote the length of shortest path from node $i$ to node $j$. For the following items, choose the correct one(s):