You just have to design an algorithm, no need to do the proof part. Please answer correctly to my question and explain, thank you.

Problem 1. Let G(V,E) be a connected, undirected graph and let sV be a source node (you may assume that the graph is given in an adjacency list format). For any vV, we call path from s to v shortish if it is either a shortest path or it has one more edge than a shortest path. (b) Design an algorithm that returns all nodes vV that are connected to s with at least two distinct shortish paths. Prove the correctness of your algorithm and analyze its run time. Your algorithm should run in time (n+m) where n=V and m=E