Let S = {pi ... Pn} be a set of n points, and let M be a planar map, given as a DCEL. Assume that the number of vertices, faces and edges are all O(n). Explain how you could find in time O(n log n) you could report for every Pi which face fj E M contains p Note that in O(n log n), your algorithm should find an answer to each one of the n points. This is not the time for a single point Let S = {pi ... Pn} be a set of n points, and let M be a planar map, given as a DCEL. Assume that the number of vertices, faces and edges are all O(n). Explain how you could find in time O(n log n) you could report for every Pi which face fj E M contains p Note that in O(n log n), your algorithm should find an answer to each one of the n points. This is not the time for a single point