Consider the three-node topology shown in the figure below. Link costs are shown in the figure. Assume (unlike in reality) that the distance-vector runs synchronously (l.e., all nodes same time). distance a. Assume the algorithm runs without poisoned-reverse. Compute the distance tables after the initialization step and after each iteration of the synchronous version of the distance-vector algorithm. tableene he aigothmrunor alothm tables. For clarification, here is the table at node X at time t-0 (when the algorithm just starts): it