Consider the following algorithm 
someAlgo that takes an undirected graph G as input.
someAlgo(G)
1. Let be any vertex in . Run BFS on starting at . Let be a vertex in at maximum distance from as given by the BFS.
2. Run BFS on again with as the starting vertex. Let be the vertex at maximum distance from as given by the BFS.
3. Output the distance between and in .
The output of someAlgo(T) for the tree shown in the given figure is ________. (Answer in integer)


