$4\mathrm{.}5.$ Often there are multiple shortest paths between two nodes of a graph. Give a linear$-$time algorithm for the following task.

Input: Undirected graph $G=(V,E)$ with unit edge lengths; nodes $u,$vinV. Output: The number of distinct shortest paths from $u$ to $v.$