don't need every node, one example from a certain node is enough

Consider the network shown below, and assume that each node initially knows the costs to each of its neighbours. For each iteration performed by the distance-vector algorithm until the algorithm enters a quiescent state, show the computed distance vector at each node. 4 12 10