Using the provided network diagram, write a program that finds the shortest path routing using the Bellman-Ford algorithm. Your program should represent the fact that your node is U. Show how the...

Using the provided network diagram, write a program that finds the shortest path routing

using the Bellman-Ford algorithm. Your program should represent the fact that your node is

U. Show how the iterative process generates the routing table for your node. One of the

keys to your program will be in determining when the iterative process is done.
Deliverables
1. Provide an output that shows the routing table for your node after each iteration. Add

a second table with two columns. One that shows the destination from your node and

the second column indicating the number of hops to reach that node.
2. Provide a Word document that explains how your program incorporates the BellmanFord algorithm. Ensure you explain how you incorporated the iterative process and

determined when the routing table for your node was optimum. You can incorporate

your outputs into this document; however, you must identify where in your source

code you print the results.
3. Provide a copy of your source code and your language of choice