Please don't copy the solution from other posts, the images are different. Thank you.

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 A D F E Figure 1: Astract graph model of a computer network 5 3 w 2 5 2. 3 Figure 4.27 . Abstract graph model of a computer network 2,0 step N' D(v),p(v) D(w),p/w) D(x), p(x) Dly),ply) D(z),p(z) U 5,0 1,0 UX 2,0 2x Uxy 2,0 3 UXY 4 uXyVw 5 uxywz Table 4.3. Running the link-state algorithm on the network in Figure 4.27 CAS NO 3, 3, 4,8 4,1 4,4