Consider the network shown in the figure below, with four nodes. The cost links are shown in the diagram.

Give the distance$-$vector routing tables for the node $C$ in the following two consecutive steps.

a$)$ Step $0$: $C$ knows the distances to its immediate neighbors.

b$)$ Step $1$: the information from the step $0$ is exchanged as per the distance$-$vector algorithm.