02 (8 points) Consider the following graphs A D Use your knowledge of the type of each graph to answer the following questions about solutions to the single- source shortest paths problem. (Note: an efficient solution must also be correct.) a. State the name of the graph(s). if any, for which Dijkstra’s algorithm would find a correct solution b. State the name of the graph(s), if any, for which Dijkstra’s algorithm is the most efficient
OR
OR