Given a set P of n points on the plane, consider the problem of finding the smallest circle containing all the points in P. Show that the following is a 2-factor approximation algorithm for this problem. Pick a point x ∈ P, and set r to be the distance of the farthest point in P from x. Output the circle centered at x with radius r