[Solved]5 Points Consider Following Greedy Strategy Finding Shortest Path Vertex Start Vertex Goal Q37196526
(5 points) Consider the following greedy strategy for finding ashortest path from vertex start to vertex goal in a given connectedgraph.
1. Initialize path to start
2. Initialize visitedV ertices to {start}
3. If start = goal, return path and exit. Otherwise,continue.
4. Find the edge (start, v) of minimum weight such that v isadjacent to start and v is not in visitedVertices.
5. Add v to path.
6. Add v to visitedV ertices.
7. Set start equal to v and go to step 3.
Does this greedy strategy always find a shortest path from startto goal? Either explain intuitively why it works, or give acounter-example.
Expert Answer
Answer to (5 points) Consider the following greedy strategy for finding a shortest path from vertex start to vertex goal in a give… . . .
OR
