Use the Warshall matrix-multiplication method to find the shortest path, show all computations

) Given a directed graph G- (1,...n), E) with distances Di.j 2 0, where D[i,il if the edge (i,j) fE. The problem is to find the shortest path between each pair of nodes. oo 0 1 2 3 oo o00 0 Use the algorithm, and show all computations