Exercise 1. Consider the graph model of the network in Figure 1. Based on the indicated link costs, use Dijkstra's shortest-path algorithm to calculate the shortest path from node F to all other network nodes. Show how the algorithm works by computing a table similar to Table 5.1 (K&R v7, page 381), the resulting routes from F and the routing table for node F. H 14 B G A 6 D F E Figure 1: Astract graph model of a computer network