Let be an undirected and unweighted graph with 100 vertices. Let denote the number of edges in a shortest path between vertices and in . Let the maximum value of , such that , be 30. Let be any breadth-first-search tree of . Which ONE of the given options is CORRECT for every such graph ?
- AThe height of is exactly 15.
- BThe height of is exactly 30.
- CThe height of is at least 15.
- DThe height of is at least 30.

