Given a directed weighted graph $G=(V, E)$, where each edge $(i,j) \in E$ has weight $w(i,j)$. The adjacency matrix $W$ is defined as below

Below is an algorithm for finding shortest paths of all vertex pairs in a directed weighted graph.

F (G,W)
{     n=|V|
      D(0)=W
      for (k = 1; i<= n; k=k+1)
        for (i = 1; i<=n; i=i+1)
          for (j = 1; j<= n; j=j+1)
            if D(k-1)[i,j]>D(k-1)[i,k] + D(k-1)[k,j]
            then D(k)[i,j]=D(k-1)[i,k] + D(k-1)[k,j]
            else D(k)[i,j]=D(k-1)[i,j]
      return D(n)
}

Which of the following statements are true?