3. Consider a network with 6 routers RI to R6 connected with links having weights as shown in the following diapram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, Which links in the network will never be used for carrying any data? Marks: 15 3. Consider a network with 6 routers RI to R6 connected with links having weights as shown in the following diapram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, Which links in the network will never be used for carrying any data? Marks: 15