You are given two convex polygons P ,Q each with n vertices on its boundary. Modify the line-sweep algorithm, so you could compute PQ in time O(n).For simplicity lets assume that P and ,Q share their leftmost point, and their rightmost point. Prove that if S is a set of axis-parallel rectangles, then S might contain (n2) vertices.