In the following network which uses Distance Vector Routing, after routers exchange distance vectors and routing tables are stable, which links are not used to carry traffhic? R1 R6 R3 RS O RA-R6 D R1-R2 R243 R2-R4 R1-R3 RS-R6 D | Question 5 4 pts Mark all statements that are TRUE about distance vector routing and link state routing The computational overhead in link state protocols is higher than in distance vector protocok 3 Distance vectors get flooded in the network until they reach every node D A distance vector protocol is very fast in recovering frors a node failure Alter a topology charge, a link state arolocol will coniverge lasler than a distance vector protocol In the following network which uses Distance Vector Routing, after routers exchange distance vectors and routing tables are stable, which links are not used to carry traffhic? R1 R6 R3 RS O RA-R6 D R1-R2 R243 R2-R4 R1-R3 RS-R6 D | Question 5 4 pts Mark all statements that are TRUE about distance vector routing and link state routing The computational overhead in link state protocols is higher than in distance vector protocok 3 Distance vectors get flooded in the network until they reach every node D A distance vector protocol is very fast in recovering frors a node failure Alter a topology charge, a link state arolocol will coniverge lasler than a distance vector protocol