Consider the network in the figure below and use Dijkstra's shortest path algorithm to calculate the shortest path from y to network node v at the link cost specified on the network graph, which of the following nodes will be passed through

$($A$)$ x

$($B$)$ w

$($C$)$ z

$($D$)$ u