Given subsets S, S2,., Sn of a set S of points and an integer m, a maximum m-cover is a collection of m of the subsets that covers the maximum number of points of S. Finding a maximum m-cover is a computationally hard problem. Give a greedy algorithm that achieves approximation ratio 1-1/e; i.e., let y be the maximum number of points that can be covered by m subsets and r be the number of points that are covered by the m subsets generated by your algorithm, then give a greedy algorithm such that x 2 (1-1/e)y Some useful hints: You may want to use the inequality (1-1/m)"