Dijkstra's algorithm is a well-known algorithm for finding the shortest distance in a graph between pairs of vertices. Use this algorithm on the digraph below, showing in detail the different steps (i.e., the evolution of the sets defined in the algorithm).

Consider the underlying graph of the digraph above and perform the same computation. Consider the underlying graph of the digraph above and perform the same computation