Suppose we have a directed graph with non-negative edge weights. It is possible for this graph to have multiple shortest paths between two nodes. In class, we saw how to find the length of the shortest path from a node s to all other nodes with Dijkstras Algorithm. Suppose that in addition to finding the length of these shortest paths, we also want to know how many shortest paths there are. Describe how we could modify Dijkstras Algorithm to do this.