12. Let P = {P1 ...Pr} be given set of points, and let S = {81...Sn} be a set of segments. No two segments in S intersect each other. Given these two sets, use the line-sweeping P21 54 P3 L Figure 2: Example of an input set of 5 segments and 4 points. The output should be: Below pi is 81. Below p2 is 33. Below P3 is $5. Below p4 = NULL technique to compute for each pi what is the segment in S vertically below it (if exists). The total time for this computation for all the input) is O(n log n). 12. Let P = {P1 ...Pr} be given set of points, and let S = {81...Sn} be a set of segments. No two segments in S intersect each other. Given these two sets, use the line-sweeping P21 54 P3 L Figure 2: Example of an input set of 5 segments and 4 points. The output should be: Below pi is 81. Below p2 is 33. Below P3 is $5. Below p4 = NULL technique to compute for each pi what is the segment in S vertically below it (if exists). The total time for this computation for all the input) is O(n log n)