Can we draw closed path made up of 9 line segments each of which intersects exactly one of the other line segmentsn

Question

This problem is taken from MATHEMATICS CIRCLE book

Can anyone tell me how the figure of this problem look like Pls elaborate with simplest explanation

Answer 1

Well, the answer is no, since for every intersection point you would complete the requirement for exactly 2 of the segments, which are, however, 9, an odd number.