Let \(𝐺(𝑉, 𝐸)\) be an undirected and unweighted graph with 100 vertices.…

Let $𝐺(𝑉, 𝐸)$ be an undirected and unweighted graph with 100 vertices. Let $𝑑(𝑢, 𝑣)$ denote the number of edges in a shortest path between vertices $u$ and $v$ in $V$. Let the maximum value of $𝑑(𝑢, 𝑣), 𝑢, 𝑣 ∈ 𝑉$ such that $𝑢 ≠ 𝑣$, be 30. Let $T$ be any breadth-first-search tree of $G$. Which ONE of the given options is CORRECT for every such graph $G$ ?