Dijkstra's algorithm serves as a primary example of which of the following? a$)$greedy algoritham b$)$Dynamic programing c $)$back tracking d$)$ branch and bound