Proof Writing & Problem Solving · Superchallenge problem

A finite set of points in the plane has all its pairwise distances different. Each point draws an arrow to its nearest neighbour (the other point closest to it). What is the largest possible number of arrows that point to one single point?