A random line segment of length D is chosen on a plane marked with an infinite checkerboard grid (i. e., a unit side length square grid). What length D maximizes the probability that the segment crosses exactly one line on the checkerboard grid, and what is this maximal probability?

for this case we have that by definition, the volume of a cylinder is given by:

where:

r: it's the radio

h: it's the height

we have as data that:

substituting:

so, the cylinder volume is

option d

i’m kinda new to precal but your answer should be 21. hope i got it right.

step-by-step explanation: