![(a) [7 Points] If there is more than one minimum cost path from x to y, will Dijkstras Algorithm always find the path with the fewest edges? If not, explain in a few sentences how to modify Dijkstras algorithm so that if there is more than one minimum cost path from x to y, a path with the fewest edges is chosen Assume no negative-cost edges.](https://d2vlcm61l7u1fs.cloudfront.net/media%2F509%2F509222a9-1ea4-4072-a80b-5dac37d1840d%2Fphp8MBudG.png)
(a) [7 Points] If there is more than one minimum cost path from x to y, will Dijkstra’s Algorithm always find the path with the fewest edges? If not, explain in
PayPal Gateway not configured
PayPal Gateway not configured
![(a) [7 Points] If there is more than one minimum cost path from x to y, will Dijkstras Algorithm always find the path with the fewest edges? If not, explain in a few sentences how to modify Dijkstras algorithm so that if there is more than one minimum cost path from x to y, a path with the fewest edges is chosen Assume no negative-cost edges.](https://d2vlcm61l7u1fs.cloudfront.net/media%2F509%2F509222a9-1ea4-4072-a80b-5dac37d1840d%2Fphp8MBudG.png)
(a) [7 Points] If there is more than one minimum cost path from x to y, will Dijkstra’s Algorithm always find the path with the fewest edges? If not, explain in
PayPal Gateway not configured
PayPal Gateway not configured