Consider a network having 6 routers P to U connected with links having weights as shown below:
All routers are using distance vector routing algorithm to update their routing table. Then what will be the shortest distance between router P and router U?
1
3
2
6
3
4
4
8