question 5

question 6

question 7

Question 5 1 pts When using Dijkstra's algorithm, synchronizing messages between all routers will prevent oscillations True False Question 6 1 pts Assume the Bellman-Ford algorithm is used to find the least cost path. How are the distance vectors initialized? Select all that apply. Nodes more than one hop away are set to a distance of co. Nodes more than one-hop away are set a distance of 0. Nodes one-hop away are set a distance equal to their link cost. Nodes set the distance to itself as 0. U Question 7 1 pts 5 7 y x 5 z 3 w 3 In the given scenario, assume the Bellman-Ford distance vector algorithm is used. Assume that in each iteration, all nodes send their distance vector to their neighbors at the same time. Distance vectors are only sent if it changed in the previous iteration. Assume all distance vectors are sent after initialization What is the distance vector of node y after the third iteration? (Answers are in the format (D)(w). Dy(x), D (/), D, (z) 1) o 110,6,0,11 o 110,2,0,11 o 19,6, 0,11 o 100,7,0,11