Answer Happy

P3. Consider the following network. a. Using Dijkstra's shortest-path algorithm to compute the shortest path from x to all network nodes with the indicated link costs. Show how the algorithm works by computing a table similar to Table 5.1. b. Using Dijkstra's shortest-path algorithm to compute the shortest path from t to all network nodes with the indicated link costs. Show how the algorithm works by computing a table similar to Table 5.1. P5. Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z. 6