Question 3 (15 point) Consider the network shown in Figure 2 (with nodes labeled ttoz ). With the indicated link costs, use Dijkstra's shortest-path algorithm (provided below) to compute the shortest path from node t to all network nodes. Show how the algorithm works by computing a table similar to Table 1 provided below, which shows the cost D() and previous nodes p(). Table 1