Question 7 Chapter 2 PART 3. Distance vector routing Z -12 -7 X W Consider the network topology in the figure above and assume that the routers are configured to use a distance vector routing protocol. NOTES: : If a cell is empty, write down NONE. If any cell is left empty, you will get ZERO for that cell. Use INF for infinite (ie, oo) Q1. What is the initial distance vector of node Y? DV of node Y X w Z Y V U Q2. Node Y has received the vectors below from its neighbors. It will then recalculate its distance vector and update its routing table. What will be the routing table of node Y? From Z From V From T From X X W Z Y V U T 8 14 0 12 20 14 19 0 0 6 3 6 1 6 1 3 5 20 8 0 3 7 4 15 7 5 5 0 New Routing table of node Y Cost Next hop Destination w Z Y V U T