Calculatethe shortest paths(Dijkstras algorithm)from A to every other vertex.

Q3 Consider the following directed, weighted graph: B 2 2 A 3 7 12 2 E F 1 -7 2 Even though the graph has negative weight edges, step through Dijkstra's algorithm to calculate supposedly shortest paths from A to every other vertex. Show your steps. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also, list the vertices in the order which you marked them known