Run Breadth First Search Directed Graph Using Vertex 3 Source Show Priority Queue Iterati Q37074086

a.

Run Breadth First Search on the directed graph below usingvertex 3 as the source.

Show the priority queue after each iteration of the while loopand the final d values.

b.

Explain briefly why the complexity of BFS is O(V+E).

c.

Give

OR

 

OR