BFS and Dijkstra's algorithm both solve the problem of single source shortest path problem BFS can only handle unweighted graph while Dijkstra's can handle weighted graphs. Answer the following questions

Problem 1: Select all the statements that are true 25

O BFS uses a normal queue to keep track of the order of nodes that it visits Dijkstra's algorithm uses a priority queue

O In BFS, each node is only enqueued at most once.

O In Dijkstra's, each node may be enqueued multiple times but with a different distance In Dijkstra's, the distances that got enqueued with a certain node is always in decreasing order (e.g. if (3, v0) is already enqueued, then if v0 happens to equeue again, the distance with it must be less than 3)

O Dijkstra's algorithm is a greedy algorithm BFS's runtime is O(V E) o O Dijkstra's runtime is O(V+ E)

O In BFS, the enqueue order is the same as the dequeue order.