Question $6.$ In the following network, each node will flood their link state information to the network. the following tables.

$N$ : set of nodes in the graph

$M$ : the set of nodes incorporated so far by the algorithm

$w(u,v)$ : the non$-$negative cost associated with the edge between nodes $u,$vinN and $w(u,v)=$ if no edge connects $u$ and $v$

$C^k(n)$ : the cost of the path from $D$ to each node $n$ in the $k^{th}$ iteration

$p$ : the newly added node to set $M$

Answer.

$\backslash$table$[[M,N-M,,],[A,B,C,D,C(B)=5,C(C)=10,C(D)=$