$1.$

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

A$.$ x

B$.$ u

C$.$ z

D$.$ w

$2.$

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

A$.4$

B$.3$

C$.5$

D$.6$