1)Draw steps of Dijkstra method for the graph below, with vertexs as the source. What are the temporary distances for each node ineach step? What is the content of the queue in each step? Whichnodes are finalized in each step?
2)Draw steps of Breadth-First Search method and Depth-FirstSearch method for the graph from Problem 10 (ignoring the weights),with vertex s as the starting vertex.

10 15 Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .