Canvas Problem#: Use Dijkstra's algorithm to find the shortest path from a to $z$ in the following graph:

Use Dijkstra's algorithm to find the shortest path from $u$ to $w$ in the

following graph:

The shortest path from $u$ to $w$ is by going $u>xw$ and is of length $6.$