Write a modified version of the Dijkstra's algorithm so that if there is more than one

minimum path from the source vertex s to a vertex v$,$ a path with the fewest number of

edges is chosen.