1. Draw the routing table for the following topology when distance vector routing algorithm is used. You need to draw the table for every node and for every round of their information exchange, until it converges. 1 Show transcribed image text 1. Draw the routing table for the following topology when distance vector routing algorithm is used. You need to draw the table for every node and for every round of their information exchange, until
OR
OR