4. Let A[1..n] be an array of points in the plane, where Alil contains the coordinates (xi,yi) of a point Pi, for i-1,....n. Give an O(n lgn) time algorithm that determines whether any two points in A are iden- tical (that is, have the same z and y coordinates)