22. Consider the following directed, weighted graph 14 2 10 F 0 3 1 2 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): Step through Bellman-Ford algorithm to calculate the single-source shortest paths from A to b) every other vertex. c) Step through the Floyd-Warshall algorithm to calculate All Pairs Shortest Paths. 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. d)