Could you please show me the detailed solution, thank you.

B E 1 The figure shows a simple network topology where link costs are equal to the load carried on the link. Here, link costs are not symetric; that is c(B.A) equals to c(A,B) only if the load carried on both directions on the link (A,B) is the same. Here, each node runs Djiskstra algorithm for finding routes with least cost paths. In this example, node A originates a unit of traffic for node D, node B also originates a unit of traffic for node D, node C originates 2 units of traffic for node D, node E originates a unit traffic for node D. Initially, node C selects node E as its next hop to node D. Node B select node A as its next hop to node D. Node A and node E send their traffic to node D directly in one hop. After the link state algorithms is run again, a. What is the cost of the link (A,D) going to be? Answer: 2 The correct answer is: 5 b. What is the cost of the link (ED) going to be? Answer: 2 The correct answer is: 0 c. Which node is the node A going to select as the next hop to send its traffic to node D? Answer: A The correct answer is: D d. Which node is the node E going to select as the next hop to send its traffic to node D? Answer: C The correct answer is: C