Consider a four$-$node topology and the link costs are c $($w$,$ x$)=4,$ c $($x$,$ y$)=3,$ c $($y$,$ z$)=8,$ c $($z$,$ w$)=12,$ and c$($w$,$ y$)=3.$

Assume that each node initially knows the costs to each of its neighbors. Compute the distance table

after the initialization step and calculate the step$-$by$-$step distance table entries of each node using the

distance vector routing algorithm for the first $3$ timestamps only. dont give me any copypasted answer please and make sure kindly answer is correct.