Which of the following is an example of a greedy algorithm?

a$)$ Dijkstra's algorithm for finding the shortest path

b$)$ Kruskal's algorithm for finding the minimum spanning tree

c$)$ The traveling salesman problem

d$)$ Both a and b