You are given a tree $G\langle V, E\rangle$ and an integer $k$. The goal is to cover $k$ edges of the graph, to minimize the length of the longest uncovered path in the tree (and to return this path's length) Constrains: $O(n\log n)$ time and $O(n)$ space. Now, the scheme of the algori...