Suppose you are given set A of'n points in the Cartesian coordinate system as follows. A= (p. pz. ps. Pa) Each point in p A has x a coordinate and a y coordinate. However, the y coordinate of all the points in set A is the same. For example, P: (x1, y) P: (x2, y), p. (x3, y)... etc Now, you need to design an algorithm to determine the two closest points. The running time of your algorithm should be O(nlogn). a) b) c) Briefly explain your strategy in solving this problem in O(nlogn) running time. You can draw a diagram if needed. Then, develop your algorithm and write it in the pseudocode format (similar to the algorithms discussed in the class). Clearly Show that the upper bound of your algorithm is O(nlogn)