Question 15
In the diagram below, there are 6 points on a circle, where the distances between adjacent points are not necessarily the same. In how many different ways can we draw at least one segment using these 6 points as its endpoints so that each point is the endpoint of at most one segment and that all the segments drawn do not intersect each other?
