We are given a n distinct points See image:

Question 7 10 pts We are given n distinct points P (,0), P2 (t2,0),..., Pn (xn,0). Write the pseudocode of an algorithm that finds the two closest points. The distance between two points P and is lai-2:1. The running time of your algorithm must be 0(nIgn)