Answer part b

22. Consider the following directed, weighted graph: 14 3 2 10 (F 3 a) Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to every other vertex Known vertices (in order marked known): every other vertex. b) Step through Bellman-Ford algorithm to calculate the single-source shortest paths from A to c) Step through the Floyd-Warshall algorithm to calculate All Pairs Shortest Paths. d) Given the graph above, list one possible order that vertices in the graph above would be processed if a breadth first traversal is done starting at A