$1.$

Consider the network in the following diagram. Using the link cost specified on the network graph, use Dijkstra's shortest path algorithm to calculate the shortest path from x to network node t through which of the following points will be passed.

A$.$ u

B$.$ v

C$.$ w

D$.$ y

$2.$

Consider the network in the following diagram. What is the shortest path cost from x to network node u using Dijkstra's shortest path algorithm with the link cost specified on the network graph?

A$.5$

B$.7$

C$.3$

D$.6$

$3.$

Consider the network in the following figure. Using Dijkstra's shortest path algorithm with the link cost specified on the network diagram, calculate the shortest path from u to network node z that does not pass through which of the following points.

A$.$ u

B$.$ w

C$.$ x

D$.$ v