In a space, there are 200 points. Each pair of these points is connected by a line segment, and the segments do not intersect each other. Each segment is colored in one of colors. Peter wants to color each point in one of these colors so that no two points and the segment between them share the same color. Can Peter always achieve this if
a) ; b) ?