$($DV routing$)$ Consider the same $5-$node string network shown below. The link costs are equal and the value is $1.$ Follow the distance vector $($DV$)$ routing principle to obtain the routing table. Shown below are the initial routing tables for each node on left side. $\text{'}$ C $\text{'}$ is the node who starts sending its routing table. Propagate the routing table and derive the final routing tables by filling in the blanks in the tables provided below.

$\backslash$table$[[A,B,C,D,E)((((($answer this steps by step process with tables$)))$