Use Dijkstra’s algorithm to find the shortest path from a to z in the following weighted graph. Please show your steps to receive any credit. Please highlight the shortest path you obtained (highlight...

Use Dijkstra’s algorithm to find the shortest path from a to z in the following weighted graph.
Please show your steps to receive any credit. Please highlight the shortest path you obtained (highlight only one shortest


path.)

The length of the shortest path is
The shortest path is