Consider five segments AB1,AB2,AB3,AB4,AB5. From each point Bi there can exit either 5 segments or no segments at all, so that the endpoints of any two segments of the resulting graph (system of segments) do not coincide. Can the number of free endpoints of the segments thus constructed be equal to 1001? (A free endpoint is an endpoint from which no segment begins.) combinatorial geometrycombinatoricsgraph