Answer Happy

Let P be a set of points in the plane and let D be a set ofpairwise disjoint circular disks.Give an algorithm that tests whether the circular disks cover thepoints, i.e., whether all points are contained in a circular disk.
Your algorithm should reach runtime O((n + m) log(n + m))where n = |P| and m = |D|.
Prove that your algorithm achieves the required running time inthe worst case.