Using Bellman-Ford algorithm find the next hop for least cost path from each node to all other nodes in the network given in Figure 2. You need to show the progressive development of the cost matrices at each node similar to the content in lecture slides 67 and 68. Where relevant also include the next hop node for the entries in the tables. From the final set of tables, identify the next hop for each node to all other nodes in the network.

13 Fi