Consider applying Floyd's all pair shortest path algorithm. To the initial graph with

the following weight matrix $D^{(0)}.$ Select the correct updated matrix $D^{(1)}$

$\left[\begin{array}{ccccccccccccccccccccc}0& 2& & 1& 8& 0& 3& 2& & & 0& 4& & & 2& 0& 3& & & & 0\end{array}\right]$

$3$

$3$

$$

$3$

$$

$$

$3$

$$

$$

$6$

$\left[\begin{array}{ccccccccccccccccccccc}0& 2& & 1& 8& 0& 3& 2& 14& & 0& 4& & & 2& 0& 3& 5& & 4& 0\end{array}\right]$

$3$

$$

$$

$6$

$\left[\begin{array}{ccccccccccccccccccccc}0& 2& & 1& 8& 0& 3& 2& 6& & 0& 4& & & 2& 0& 3& & & & 0\end{array}\right]$

$3$

$1$

$$

$6$

$\left[\begin{array}{ccccccccccccccccccccc}0& 2& 5& 1& 8& 0& 3& 2& & & 0& 4& & & 2& 0& 3& & & & 0\end{array}\right]$

$3$

$$

$$

$6$

$\left[\begin{array}{ccccccccccccccccccccc}0& 2& & 1& 8& 0& 3& 2& 8& & 0& 4& & & 2& 0& 3& & & & 0\end{array}\right]$

$3$

$$

$$

$6$