Question 14
Given a set of $n$ non-intersecting segments in the plane. No two segments lie on the same line. Can we successively add $n-1$ additional segments so that we end up with a single non-intersecting path? Each segment we add must have as its endpoints two existing segment endpoints.