QUESTION 10 1 points Save Answer Given the following graph: 9 4 B 2 3 2 3 2 E What is the shortest path from A to Eatter

[answerhappygod]

Question 10 1 Points Save Answer Given The Following Graph 9 4 B 2 3 2 3 2 E What Is The Shortest Path From A To Eatter 1 (20.65 KiB) Viewed 89 times

Question 10 1 Points Save Answer Given The Following Graph 9 4 B 2 3 2 3 2 E What Is The Shortest Path From A To Eatter 2 (33.35 KiB) Viewed 89 times

QUESTION 10 1 points Save Answer Given the following graph: 9 4 B 2 3 2 3 2 E What is the shortest path from A to Eatter the third iteration of Dijkstra's algorithm? What is the overall shortest path at the end of the algorithm? 3rd Iteration: Overall Shortest: 9 3rd Ieration: 11 Overall Shortest: 10 3rd iteration: 10 Overall Shortest: 9 3rd Iteration: 11 Overall Shortest: 9

1 points Save Ares QUESTION 11 Suppose we have a network where the routers are performing distributed distance Vector routing via the Belman-Ford algorithm Suppose we have the following estimates: Local Estimates Neighbors' Estimates Dx(A) * 8 DA(Y) 15 DX(B) 4 De(Y)= 20 Dx(C)=7 DcY) 18 Dx(D) - 14 Doly) - 14 where A, B, C, and D are routers directly linked to router X and Y is a destination host. Assuming we are sending a datagram from router X to host Y, to which neighbor should we forward the datagram'? СА QUESTION 12 1 points Suve we Which of the following is not a drawback of using Dijkstra algorithm for routing? Dijkstrara algorithm is distributed and only has a localized view of a single router and its neighbors meaning that network Information propogates slowly to other nodes. Optimal routing can become sub-optimal Ir the increase in datagrams traveling along optimal edges suddenly increases the congestion along those edges These are al drawbacks of using Dijkstra's algorithm The runtime complexity of O(n) for the optimized O/NlogN) version) makes the algorithm infeasible for extremely large networks.