Compute the distance vector tables for each node, until they reach a settled state. Present your tables in the style used in the example shown below, with each iteration appearing in a separate column.

6 B 3 1 D 3 C 5 Iteration 2 and so on... Iteration 1 cost to Node B D Node A B C D A 0 6 3 8 from B 8 00 8 00 B ? 8 00 00 00 Node B A B C D Node B A B D A 00 8 00 A B 6 0 1 3 B ? 8 00 00 D 8 8 8 8 D and so on. 6 B 3 1 D 3 C 5 Iteration 2 and so on... Iteration 1 cost to Node B D Node A B C D A 0 6 3 8 from B 8 00 8 00 B ? 8 00 00 00 Node B A B C D Node B A B D A 00 8 00 A B 6 0 1 3 B ? 8 00 00 D 8 8 8 8 D and so on