Let S be a subdivision of complexity n, and let P be a set of m points. Give a plane sweep algorithm that computes for every point in P in which face of S it is contained. Show that your algorithm runs in O((n+m)log(n+ m)) time