Please type your answer, Thanks!

Problem 1. (40 points) Let 11-12 , In be a set of closed intervals on the real line, with 1,-ai, bij. Design an efficient greedy algorithm to compute the smallest set S of points such that each interval contains at least one point. Analyze the time complexity of your algorithm and prove that it always produces the optimal solution