Suppose you are given two sets of n points, one set {p1,p2,,pn} on the line y=0 and the other set {q1,q2,,qn} on the line y=1. Create a set of n line segments by connecting each point pi to the corresponding point qi. Describe and analyze a divideand-conquer algorithm to determine how many pairs of these line segments intersect, in O(nlogn) time