Define the shortest path problem and describe Dijkstra's algorithm. Give an example to illustrate how this algorithm wor

[answerhappygod]

Define the shortest path problem and describe Dijkstra's
algorithm. Give an example to illustrate how this algorithm
works. Using the same example, compare the shortest path from a
designated vertex to all other vertices, to the minimum
spanning tree originated from the same starting vertex. Are
they the same? (No code necessary)