Need help with this. Fill in the blanks.

Consider this network of routers A$,$ B$,$ C$,$ and D that are using Distance Vector Routing. Assume that all routers are turned

on at the exactly same time $0.$ At time $0,$ the routers know only the cost to reach their immediate neighbors. At time $0$

$($Round $0),$ all routers send their distance vector to their immediate neighbors. Each $30$ seconds, a new round of

exchanges occurs. Fill in the table below with the distance vector that Node B sends its neighbors on Round $0.$ If the

distance is not yet known, fill in with the value $99.$