Use Dijkstra's algorithm to determine the length of a shortest path between the vertices a and h in the following weighted graph.
It is very important to note that that every iteration of the algorithm must be shown and a brief explanation for every step (subgraph) must be provided, as just writing the correct length of the shortest path is not enough at all. In other words, you must show your work.