The idea here is to modify Bellman ford's algorithm in some way. I don't quite understand how to do it, my solution seems to not be working correctly. Would appreciate a thorough answer, preferrably in Python! (I've seen this question answered before, but the answers have been wrong. The answer includes a modification of bellman ford's algorithm.)

2. (10 marks) To assess how "well-connected" two nodes in a directed graph are, one can not only look at the length of the shortest path between them, but can also count the number of shortest paths. This turns out to be a problem that can be solved efficiently, subject to some restrictions on the edge costs. Suppose we are given a directed graph G = (V,E), with costs on the edges: the costs may be positive or negative, but every cycle in the graph has strictly positive cost. We are also given two nodes v, w V. Give an efficient algorithm that computes the number of shortest u w paths in G. (The algorithm should not list all the paths; just the number suffices.) You do not need to give a formal proof of correctness but should justify your recurrence relation and the complexity