Please help me with this algorithm question. Thank you so much.

==========================================================

necteu patils IOl SUOL. 11l dloll Crrectiess i dlaly2e lUs tlme conipiexlty 3. (30 points) Design an algorithm that runs in time O(VI E) that takes as input a con- nected, undirected, unweighted graph G = (V,E), a source vertex s E V, and a target vertex t V, and finds the number of shortest paths from s to t. Argue your algorithm's correctness and analyze its time complexity