Can you please explain what is going on? Thank you!

I. 16 points) In applying the Floyd Algorithm to a weighted undirected (therefore symmetrical) graph with 5 vertices, we have arrived at the following arrays D3) and P(3). 10 0 0 0 0 20 0 0 3 1 3 0 0 0 0 1 4 0 3 0 0 1 50 1 1 1 0 10 4 6 3 2 2 4 0 5 6 6 3 6 5 0 1 8 4 3 6 1 0 5 5 2 6 8 5 0 Compute the following values in the arrays D4) and P) C3) D[5113]-D13][5] minm(D P5113] P3]5 Assuming that P(5)- P), show how to find the shortest (minimum weight) path from v3 to v5- P 31151 CS) PC) 3 Show transcribed image text I. 16 points) In applying the Floyd Algorithm to a weighted undirected (therefore symmetrical) graph with 5 vertices, we have arrived at the following arrays D3) and P(3). 10 0 0 0 0 20 0 0 3 1 3 0 0 0 0 1 4 0 3 0 0 1 50 1 1 1 0 10 4 6 3 2 2 4 0 5 6 6 3 6 5 0 1 8 4 3 6 1 0 5 5 2 6 8 5 0 Compute the following values in the arrays D4) and P) C3) D[5113]-D13][5] minm(D P5113] P3]5 Assuming that P(5)- P), show how to find the shortest (minimum weight) path from v3 to v5- P 31151 CS) PC) 3

## Expert Answer

Answer to I. 16 points) In applying the Floyd Algorithm to a weighted undirected (therefore symmetrical) graph with 5 vertices, we…