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. Make sure that you show all steps in each algorithm, as done in the class with the table (a) Use Dijkstra's Algorithm (b) Use Bellman-Ford Algorithm (assuming that update order is B C D E F and back to B, then repeat) 9 2 Figure 1: Network for Routing Problem 3