We are given n distinct points P1(x1,0),P2(x2,0),...,Pn(xn,0). Write the pseudocode of an algorithm that finds the two closest points. The distance between two points Pi and Pj is |xixj|. The running time of your algorithm must be O(nlgn).