The following matrix D² represents the shortest distances of Floyds algorithm. Show the calculations of this algorithm to obtain the next matrix (i.e. D³ ). How many more matrices have to be calculated to obtain the shortest distance between any two nodes? Also, determine the shortest route from node 1 to the node 3,

D^{2 =}

0 8 5

3 0 8

5 2 0