Computer Networks Question:

3 3.1 Consider a network with N routers which are connected in star topology. The link weights are all W. A distance vector protocol with poisoned reverse is used. Messages are sent to neighbors only after the distance vector changes. After the protocol stabilizes, one of the link weights changes (nodes on both sides will notice the weight change). What is the maximum number of messages that will be transmitted as a result? (explain your answer) 3.2 Consider a topology which is a complete graph (i.e. all the routers are connected to each other). The link weights are all 2. Suppose one of the link weights is now changed from 2 to 3 (nodes on both sides will notice the weight change), what is the maximum number of messages that will be transmitted as a result