Suppose instead of finding a shortest path from s to t in an undirected graph G with positive edge weights, you want to count the number of shortest paths from s to t. How would you modify Dijkstras algorithm to solve this problem? Explain why your modifications work.

Hint: You dont have to change any of the steps in Dijkstras algorithm (See pseudocode I am using which is http://www.gitta.info/Accessibiliti/en/html/Dijkstra_learningObject1.html ), just add new ones.