5. Let G = (V, E) be an undirected graph, and let s and t be two vertices of G. Give an efficient algorithm for computing the number of different shortest paths from s to t. The length of a path is the number of edges on it, and two paths are different if the sets of edges that they use are different. You shouldnt return the actual paths, just their number.

Hint 1: Store some information at each node.

Hint 2: If your solution has a count + 1 someplace in it, its probably wrong.