a. A point (x, y) in the Cartesian plane is said to be dominated by point (x, y)) if x, x, and y, y, with at least one of the two inequalities being strict. Given a set of n points, one of them is said to be a maximum of the set if it is not dominated by any other point in the set. For example, in the figure below, all the maximum points of the set of 10 points are circled. YA Design an efficient algorithm for finding all the maximum points of a given set of n points in the Cartesian plane. What is the time efficiency class of your algorithm? b. Give a few real-world applications of this algorithm.