Dynamic Prosraming

Consider the road network shown in Fis. $2$ where the nodes indicate places, the edges

jodicate roads and the numbers at the edses indicate the traveling time between the

oudes connected by the edge. The goal is to travel from node $S$ to node $L$ traversing

the fastest route.

$($a$)$ Solve the fastest route problem for the road network siven in Fig. $2$ using dynamic

ecosconojos! Wark the fasted route in Fig. $2!$

$($b$)$ Now, a congestion affects some roads in the network as indicated in

Fig. $3$ by the dashed lines. Solve the fastest route problem of the road

network given in Fig. $3$ using dynamic programming! Which nodes have to

be re$-$evaluated given your calculations in $($a$)?$ Mark the fastest route

in Fig. $3!$