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?

connie < felicia < stew

step-by-step explanation:

stew:

we need to find the slope

m = (y2-y1)/ (x2-x1)

    = (2650-795)/(10-3)

    = 1855/7

265 words per minute

connie:

we need to find the slope

m = (y2-y1)/ (x2-x1)

we have two points (0,0) and (4,800)

m = (800-0)/(4-0)

  m = 800/4

    200 words per minute

felicia:

260 words per minute

200< 260 < 265

connie < felicia < stew

15 batches are the most you can make

step-by-step explanation:

im pretty sure its

(8,15)

step-by-step explanation:

30 feet

step-by-step explanation:

that would be 2 1/2 * 12

= 24 + 6

= 30 feet   (answer)