Consider the following algorithmic problem: Given n points (xi,yi) in the plane, find the pair of them whose Euclidean distance ( /(ri-rj)2 + (Vi-%)2) 1s as small as possible. There is an obvious O(n2) algorithm for this, but with a little effort, you can get it down to near linear time. Problem:Give a full near-linear time algorithm for closest pair of points Extended hint: An outline of a working algorithm will look something like this CPP (S) If ISI