Caitlin wants to draw n line segments, without lifting her pencil off the paper and without retracing her path, so that each segment crosses exactly one other segment (not counting intersections at vertices) and she ends up back where she started. A. Show how she can do this for n = 6. B. For which n can it be done, and for which n is it impossible?