CSE3500-001 Programming Assignment #2 Distance Vector Algorithm: Good News Travels Fast, Bad News Travels Slow For this programming assignment, please read the corresponding slides for distance vector algorithm to get a good understanding of the algorithm, and then implement the algorithm, and run the algorithm to do the following. 1. Calculate distance vectors for node x, y and z given the link costs on slide 5-8. Report the number of iterations it takes for the distance vectors to converge. 2. After the distance vectors have already converged, change the cost c(x, y) to 1 from 4. And keep running the distance vector algorithms on node x, y and z and see how many iterations does it take for the distance vectors to converge. 3. After the distance vectors have already converged again, change the cost c(x, y) to 60 from 1. And keep running the distance vector algorithms on node x, y and z, and see how many iterations does it take for the distance vectors to converge. 4. Discuss in your report whether the "Good news travels fast and bad news travels slow" phenomenon is true for the distance vector algorithm. Discuss whether you observed the count to infinity problem. Some hints for the implementation. Use global arrays for distance vectors for node x, y and z. When a node's distance vector is updated, it needs to notify its neighbors. In our implementation, when this happens, we can update the corresponding distance vectors for all the neighbors. Make sure in your implementation that any changes to link costs can be detected, and any changes to distance vectors can be detected. When you turn in your assignment, please turn in both your code and your report. Make sure your code is commented.