5. Now consider a weighted, directed graph G with n vertices and its corresponding adjacency matrix M, where M(i,j)-0 if i -j, M(i.j)weight((i.j)) if (i.j) is in G and M(i.j) Here, let otherwise M2 min[M(i, 1) + M(1.j),M(i, 2) M(2,j). M(i,n) M(n,) where + is regular addition. If M2(i,j)- d, what may we conclude about vertices i and j? What about M* for any 1 s k s n