Write an algorithm that accepts a set of line segments and a two-dimensional orthogonal range query and returns the total number of line-segment intersec- tions that line inside of that range. Note,...

Extracted text: Write an algorithm that accepts a set of line segments and a two-dimensional orthogonal range query and returns the total number of line-segment intersec- tions that line inside of that range. Note, even if the endpoints of the segements intersecting lie outside the range, we still want you to return the intersections themselves if they lie inside of the range!