The Dijkstra’s algorithm is a greedy algorithm because:
A.
At each step, the algorithm picks the link with the smallest cost
B.
At each step, the algorithm picks the node with the smallest estimated distance
C.
At each step, the algorithm picks the path with the smallest number of links
D.
None of the options given