Using Dijkstras algorithm create a least cost path from node A to all other nodes in the network given in figure 1 below. You need to show the final table resulting from applying Dijkstras algorithm to the network. For each iteration include the whole path from A to the particular node (Similar to the table 19.4 on page 645 of the textbook). From that table using the least cost paths developed create a central routing directory for the network.

4 4 Figure 1