please explain each option

Suppose we run BFS from a start node s in an unweighted undirected graph, which finds a shortest paths tree from s to every other reachable node in the graph. The distance (in terms of edges) to each reachable node t is given by distTo.get(t). Which of the following statements are true about a shortest path between any two other nodes u and v-assuming neither is the start node? Explain your reasoning for all 4 answer choices. There can only exist a single shortest path from u to v. A shortest path from u to v must include one or more edges in the shortest paths tree from s. If the shortest paths tree reaches u and v, then a shortest path from u to v must exist. The distance of a shortest path from u to v cannot be greater than distTo.get(u) + distro.get(v)