Linear algorithm to find two points with at least half diameter distance in a point set

Question

I am stuck with the following homework problem:

Consider a point set P in the plane with |P| = n and let D(P) the diameter of P, i.e. the maximum Euclide