Short answer for every selection, Please! Thank

[answerhappygod]

Short answer for every selection, Please! Thank

Short Answer For Every Selection Please Thank 1 (171.59 KiB) Viewed 47 times

QUESTION 10 Given the following graph: 9 4 B D 2 2 A 3 2 F. 7 C E 6 8 What is the shortest path from A to E after the third iteration of Dijkstra's algorithm? What is the overall shortest path at the end of the algorithm? O 3rd Iteration: 9 Overall Shortest: 9 O 3rd Iteration: 11 Overall Shortest: 10 3rd Iteration: 11 Overall Shortest: 9 O 3rd Iteration: 10 Overall Shortest: 9 QUESTION 11 Suppose we have a network where the routers are performing distributed distance vector routing via the Bellman-Ford algorithm. Suppose we have the following estimates: Local Estimates Neighbors' Estimates DX(A) = 8 DA(Y) = 15 Dx(B) = 4 DB(Y) = 20 DX(C) = 7 Dc(Y) = 18 DX(D) = 14 DD(Y) = 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? OA OB ос OD QUESTION 12 Which of the following is not a drawback of using Dijkstra's algorithm for routing? Optimal routing can become sub-optimal if the increase in datagrams traveling along'optimal' edges suddenly increases the congestion along those edges. Dijkstra's 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. The runtime complexity of O(N2) for the optimized O(NlogN) version) makes the algorithm infeasible for extremely large networks. These are all drawbacks of using Dijkstra's algorithm.