3. Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3.

After how many time ticks, will L's distance vector (i.e., its DV that it exchanges with its neighbor) reflect this change in topology?

Problem 2: Compute the shortest path from s to t in the following network using the Bellman-Ford algorithm. 2 (² 5 3 2 1 -2 2 -1 (3 t -4

Dynamic ProgrammingConsider the following network below:   (a) Label all of the nodes such that for every arc, (i,j), where i is the start and j the end node for the arc, the labels satisfy i < j.(b) Why can we use the node labeling algorithm to label the nodes in this network? (c) Use forward DP to find the shortest path from your first labeled node to every node in the network.(d) What fundamental characteristic of dynamic programs allow us to breakdown large-sized problems into a series of smaller-sized problems? What does this characteristic establishes?