22. Consider the following directed, weighted graph: 4 14 2 10 F 3 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): b) Step through Belman-Ford algorithm to Bellman-Ford algorithm to calculate the shortest paths from A to every other vertex. 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 c) d) processed if a breadth first traversal is done starting at A