Suppose that the FlSuppose that the Floyd's Dynamic Programming algorithm for the All$-$Pairs Shortest Path Problem has been

applied to some input graph that has four vertices, and the following distance matrix is obtained $($please

remember the notation we use for values in matrix cells. For example, in $\frac{6}{2},6$ is the distance, and $2$ denotes

vertex $2)$:

C:

Answer the following:

$[2$ pt$]$ What is the shortest distance from vertex $1$ to vertex $4?$

$[2$ pts$]$ Show an optimal path from vertex $1$ to $4.$ Briefly explain how you construct this path using distance

matrix $C.$oyd$$s Dynamic Programming algorithm for the All$-$Pairs Shortest Path Problem has been applied to some input graph that has four vertices, and the following distance matrix is obtained $($please remember the notation we use for values in matrix cells. For example, in $6/2,6$ is the distance, and $2$ denotes vertex $2)$:

Answer the following:

$[2$ pt$]$ What is the shortest distance from vertex $1$ to vertex $4?$

$[2$ pts$]$ Show an optimal path from vertex $1$ to $4.$ Briefly explain how you construct this path using distance matrix C$.$