I need help solving the following problem. It should be in plain words rather than any particular coding language.

2. (Worth: 3 points. Page limit: 1 sheet; 2 sides) Sometimes there are multiple shortest paths between pairs of nodes in a graph. Develop an algorithm for the following task: given an undirected graph G = (V E) with unit edge lengths and nodes v and w, output the number of distinct shortest paths from v to w. For example, for the graph below, on input v and w your algorithm should output 2. Your algorithm should run in linear time. Prove the correctness of your algorithm and analyze its running time 2. (Worth: 3 points. Page limit: 1 sheet; 2 sides) Sometimes there are multiple shortest paths between pairs of nodes in a graph. Develop an algorithm for the following task: given an undirected graph G = (V E) with unit edge lengths and nodes v and w, output the number of distinct shortest paths from v to w. For example, for the graph below, on input v and w your algorithm should output 2. Your algorithm should run in linear time. Prove the correctness of your algorithm and analyze its running time