operations research

The following table shows the first 3 iterations of the shortest path problem. between every pair of nodes. complete the iterations and say the name of the algorithm. and give the path between every pair of nodes.

D3=\begin{tabular}{c|c|c|c|c|c|c|} & 1 & 2 & 3 & 1 & 5 & 6 \\ \cline { 2 - 7 } & 0 & 4 & 1 & 1 & & 8 \\ \hline 2 & 4 & 0 & 5 & 5 & & 4 \\ \hline 3 & 1 & 5 & 0 & 2 & 3 & 5 \\ \hline 4 & 1 & 5 & 2 & 0 & 5 & \\ \hline 5 & & & 3 & 5 & 0 & 4 \\ \hline 6 & & & 5 & 4 & 4 & 0 \\ \hline \end{tabular} A3=\begin{tabular}{l|l|l|l|l|l|l|} & 1 & 2 & 3 & 1 & 5 & 6 \\ \hline & 1 & 2 & 2 & 3 & 5 & 2 \\ \hline 2 & 1 & 2 & 1 & 1 & 5 & 6 \\ \hline 3 & 1 & 1 & 3 & 4 & 5 & 6 \\ \hline 4 & 1 & 1 & 1 & 4 & 5 & 6 \\ \hline 5 & 1 & 2 & 3 & 4 & 5 & 6 \\ \hline 6 & 1 & 2 & 3 & 4 & 5 & 6 \\ \hline \end{tabular}