Consider the network shown below with the given link costs. Initially each node knows only its neighbors and cost of the links to them. The link-state algorithm is used to compute the routes. Initially, each nodes sent its link-state information to all other nodes, and each node computed the least-cost paths to all other nodes in the network based on the link-state updates it received. A node sends new link-state updates only if there are changes to the costs or status of its links. Match each of the statements or questions in the left column with the most appropriate response from the right column. u 9 V W 7 2 X 9 What is the next hop for the least-cost path from W to U? What are the nodes in the least-cost path from Y to U? C. B. F. If link (VW) foes down, which nodes send link-state updates to all other nodes in the network? A. If link (VX) goes down, link-state advertisements are sent, and new paths are computed, then what nodes are in the least-cost path from U to Y? A. Nodes V, X, and Y B. Nodes X, V, and U C. Node V D. Nodes V, W, X, and Y E. All nodes F. Nodes V and W