. Given the followingadjacency lists (with edge weights in parentheses) for a directedgraph:
A: B(5), C(3), D(1) B: C(1), D(3)
C: B(3), D(7), E(1) D: A(6), C(3)
E: F(5)
F: D(3), A(4)
Execute Dijkstra’s shortest-pathalgorithm by hand on this graph, showing how the data structuresevolve, with A as the starting vertex. Clearly indicatewhich edges become part of the shortest path and in whichorder.
Expert Answer
An answer will be send to you shortly. . . . .