Write down Dijkstra’ algorithm. Consider the following directed graph and Run Dijkstra’salgorithm on it. Using a Word document, illustrate your work with all steps taken in thealgorithm by drawing...

Dijkstra's Algorithm allows for finding the shortest path between two vertices of the graph. This can help in minimizing the spanning tree because of the shortest path that is between two vertices that might not include all vertices that present on the graph. It is the single source shortest path from sources to all nodes that are present in the figure (Wang, Mao & Eriksson, 2019). The algorithm can be used for finding the shortest path that is starting from the node to the target node in the weighted graph. It can help in solving...