1. Explain how to modify Bellman-Ford's algorithm to efficiently count the number of shortest paths (of equal weight) from a source vertex to every other vertex in the graph. 2. Provide and analyze the running time of an algorithm for finding the shortest simple paths from a source vertex to every other vertex in a graph, even if the graph has a negative-weight cycle.