Dijkstra always chooses the closest vertex in V-S to add to set S where V= vertex set and S =set of vertices whose final shortest path weights from the source have been obtained.
So Dijkstra's algorithm is a greedy algorithm.Hence answer is option 3.