5. (3 points) You are given n points on a two-dimensional plane. Each point is specified by a tuple of X and Y coordinates. A point (r, y) is said to dominate point (c',y) if and only if I >I' and y >y'. Design an algorithm to output all points that are not dominated by any other point. Give pseudocode and discuss correctness and running time. 5. (3 points) You are given n points on a two-dimensional plane. Each point is specified by a tuple of X and Y coordinates. A point (r, y) is said to dominate point (c',y) if and only if I >I' and y >y'. Design an algorithm to output all points that are not dominated by any other point. Give pseudocode and discuss correctness and running time