Find the shortest distance path from node A to all other nodes in the network shown below in Figure 1. The link metric shown is for the symmetric cost for each link, i.e., the cost of going from A to B is the same as the cost of going from B to A. Use Bellman-Ford Algorithm (assuming that update order is B C D E F and back to B, then repeat) Make sure that you show all steps, as done in the example below: Cycle Node label Initial (A,2) Update order here B C D E F Dest. A