Question

B. Dijkstra's Algorithm is the prime example for
O A. Greedy algorithm
O B. Branch and bound
O C. BAK tracking
O D. Dynamic programming​

Answer 1

Answer:

no c

Explanation:

hope this answers helped u please mark me as branliest

Answer 2

Answer:

c Bak tracking is the answer