For the following the code should be written based on the pseudo code listed in the pic. Also the reason why this language was chosen for the code has to be mentioned in design section. Thank You. I will make sure to rate!

kk

For this project, you will write a program that implements the Distance Vector Routing Algorithm. Must upload a Word or PDF file only. Justify the use of the programing language in your design section. Distance Vector Routing () 2 3 4 5 6 7 8 9 10 // Initialize (create initial vectors for the node) D[myself0 for (y= 1 to N) if (y is a neighbor) D[y] = c[myself][y] else 12 13 send vector (D[1], D[2], DIN]) to all neighbors // Update (improve the vector with the vector received from a neighbor) repeat (forever) 15 16 17 18 19 20 21 wait (for a vector Dw from a neighbor w or any change in the link) for (y= 1 to N) D[y] = min [D[y], (c[myself][w] + Dwly])] I/ Bellman-Ford equation if (any change in the vector) send vector (D1, DI2],, DIN]) to all neighbors 23 24 I End of Distance Vector Design Code: Output: For this project, you will write a program that implements the Distance Vector Routing Algorithm. Must upload a Word or PDF file only. Justify the use of the programing language in your design section. Distance Vector Routing () 2 3 4 5 6 7 8 9 10 // Initialize (create initial vectors for the node) D[myself0 for (y= 1 to N) if (y is a neighbor) D[y] = c[myself][y] else 12 13 send vector (D[1], D[2], DIN]) to all neighbors // Update (improve the vector with the vector received from a neighbor) repeat (forever) 15 16 17 18 19 20 21 wait (for a vector Dw from a neighbor w or any change in the link) for (y= 1 to N) D[y] = min [D[y], (c[myself][w] + Dwly])] I/ Bellman-Ford equation if (any change in the vector) send vector (D1, DI2],, DIN]) to all neighbors 23 24 I End of Distance Vector Design Code: Output