RIP Limitations & Problems

Consider the given example network

Assume that all nodes are switched on at the same time $t=0$

Immediately after being switched on$,$ each node informs its neighbors about

its presence.

Each node transmits its distance vector message every $60$ seconds

After receiving the distance vector messages the shortest path computations

takes one second

Calculate the time of convergence of this example network.