3. Bellman Ford Distance Vector Algorithm (for computing least cost paths) Consider the 3-node network shown below, with the given link costs 2 Before doing this problem, you might want to reread the section on Bellman Ford DV in chapter 5 and view this youtube video that fits our slides https://www.youtub Fill in the table on the distance vectors in each of the routers for each iteration until the algorithm converges. A. The initial distance vectors (when each node only knows the one-hop link cost to its directly- attached neighbors) at each router will be: X table X Y table X Z table | X | Y |Z B. The distance vector of the nodes after first iteration: X table X Y table X Z tableX C. The distance vector of the nodes after second iteration: X table X Y table X Z tableX