Dijkstra’s Algorithm is the prime example for ___________

• A. Greedy algorithm
• B. Branch and bound
• C. Back tracking
• D. Dynamic programming