Given a set S of n disjoint line segments in a plane and a set T of m triangles in the plane. The triangle in Tare disjoint, but a triangle could lie inside another triangle. Devise an algorithm to report all triangles of T that do not intersect any line segment of S. USE PLANE SWEEP ALGORITHM.