Suggest an O(n log n) time algorithm that receives a set S of n horizontal segments and n vertical segments. No two endpoints of segments have the same x coordinate nor the same y-coordinate. Suggest an O(n log n) time algorithm that computes the number M, defined as the number pairs of segments in Sthat cross each other. Note that this number M be as large as n, which is much larger than the requested running time. Hint: You could use Question 8, even if you were not able to