1 problem

Let $f(n)$ be the minimum number of segments such that every set of $n$ points in the plane can be covered by a possibly self-intersecting polygonal path, and let $g(n)$ be the min…