Given 2 sets of point namely P={p1,p2,...,pn} and Q={q1,q2,...,qn}. Those 2n points all lie on the unit circle. Draw segment (pi,qi). Determine the number of intersecting pair of segments. The required complexity for this problem are O(nlogn^2) and O(nlogn). Could someone give me a hand in this problem?