Consider a tree T with n vertices, where n is an odd integer greater than or equal to 3. Let v be a vertex of T. Prove that there exists a vertex u in T such that the distance between u and v is at most (n-1)/2