By using Dijkstra's algorithm, it can be concluded that-
It will loop forever.
Third option is correct
What is Dijkstra's algorithm?
Dijkstra's algorithm is used to find the shortest path between the nodes of a graph.
Here, a node is fixed which is called the source node and the distance from the source node to all other nodes are calculated.
The minimum distance gives the shortest path.
For the first option,
The first option is incorrect because the shortest path will not be obtained. There does not exist path between every pair of vertices
For the second option
The second option is incorrect because all the conditions of Dijkstra's algorithm are fulfilled but here, infinite looping takes place.
For the fourth option
The fourth option is incorrect because there exist a path between the point M and every other vertex in the graph.
So the third option is correct
To learn more about Dijkstra's algorithm, refer to the link-
https://brainly.com/question/15392537
#SPJ4
Complete Question
The complete question has been attached
